2976 search results - page 219 / 596 » On the bounded integer programming |
141
click to vote
JISE
2006
15 years 6 months ago
2006
in an abstract Cartesian space of program versions characterized by dialect variables. An optimal solution to the problem is derived based on its translation to a restricted Intege...
220
click to vote
CPAIOR
2011
Springer
14 years 10 months ago
2011
Springer
In this work we present the Partner Units Problem as a novel challenge for optimization methods. It captures a certain type of configuration problem that frequently occurs in indu...
188
click to vote
DSN
2005
IEEE
16 years 3 days ago
2005
IEEE
The ability to check memory references against their associated array/buffer bounds helps programmers to detect programming errors involving address overruns early on and thus avo...
166
click to vote
ISHPC
2003
Springer
15 years 11 months ago
2003
Springer
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...
162
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We provide new and tight lower bounds on the ability of players to implement equilibria using cheap talk, that is, just allowing communication among the players. One of our main r...