1197 search results - page 77 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
136
click to vote
AI
2007
Springer
15 years 11 months ago
2007
Springer
When using Bayesian networks, practitioners often express constraints among variables by conditioning a common child node to induce the desired distribution. For example, an ‘orâ...
121
click to vote
SIAMJO
2008
15 years 5 months ago
2008
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
167
click to vote
COCOA
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
171
click to vote
DCOSS
2006
Springer
15 years 9 months ago
2006
Springer
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
175
click to vote
DEDS
2010
15 years 2 months ago
2010
We consider Discrete Event Systems (DES) involving tasks with real-time constraints and seek to control processing times so as to minimize a cost function subject to each task mee...