Back to Results
First PageMeta Content
Operations research / Computing / Job shop scheduling / Mathematical optimization / Multiplicative order / Scheduling / Modulo / Very long instruction word / Software pipelining / Compiler optimizations / Modular arithmetic / Mathematics


Time-Indexed Formulations and a Large Neighborhood Search for the Resource-Constrained Modulo Scheduling Problem Benoˆıt Dupont de Dinechin STMicroelectronics STS/CEC 12, rue Jules Horowitz - BP 217. FGrenoble b
Add to Reading List

Document Date: 2007-06-06 10:50:57

Open Document

File Size: 181,01 KB

Share Result on Facebook

Company

STMicroelectronics / Dupont / /

/

Facility

Homewood / Callable Library / /

IndustryTerm

large neighborhood search heuristic / dichotomy search / large neighborhood search benefits / instructionlevel parallel processors / large neighborhood search / pseudo-solution / incumbent solution / instruction-level parallel processors / label-correcting algorithm / /

Person

Alvarez-Valde Constraints / /

/

ProgrammingLanguage

C * / /

PublishedMedium

The International Journal / /

Technology

mobile phones / ST200 VLIW processors / generic LNS algorithm / Parallel Processing / label-correcting algorithm / instructionlevel parallel processors / instruction-level parallel processors / /

URL

http /

SocialTag