388 search results - page 60 / 78 » A Mixed Closure-CSP Method to Solve Scheduling Problems |
104
click to vote
DAGSTUHL
2004
15 years 3 months ago
2004
Complexity is the core problem of contemporary information technology, as the "artificial complicatedness" of its artefacts is exploding. Intellectually easy and economic...
106
click to vote
IUI
2005
ACM
15 years 7 months ago
2005
ACM
We present PLIANT, a learning system that supports adaptive assistance in an open calendaring system. PLIANT learns user preferences from the feedback that naturally occurs during...
127
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
Bush fires cause major damage each year in many areas of the world and the earlier that they can be detected the easier it is to minimize this damage. This paper describes a coll...
172
click to vote
WEA
2010
Springer
15 years 8 months ago
2010
Springer
We present a new Feasibility Pump algorithm tailored for nonconvex Mixed Integer Nonlinear Programming problems. Differences with the previously proposed Feasibility Pump algorith...
112
click to vote
COR
2008
15 years 1 months ago
2008
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...