Sciweavers

2636 search results - page 262 / 528
» Linear Programming
Sort
View
JAIR
2011
123views more  JAIR 2011»
14 years 10 months ago
The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...
JNW
2006
126views more  JNW 2006»
15 years 3 months ago
Gateway Deployment optimization in Cellular Wi-Fi Mesh Networks
With the standardization of IEEE 802.11, there has been an explosive growth of wireless local area networks (WLAN). Recently, this cost effective technology is being developed aggr...
Rajesh Prasad, Hongyi Wu
JAMDS
2002
65views more  JAMDS 2002»
15 years 2 months ago
Optimum workforce scheduling under the (14, 21) days-off timetable
Abstract. An efficient optimum solution is presented for a real-life employee daysoff scheduling problem with a three-week cycle. Over a given work cycle, each worker is given 14 s...
Hesham K. Alfares
MP
2010
94views more  MP 2010»
15 years 1 months ago
MIR closures of polyhedral sets
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
CORR
2008
Springer
124views Education» more  CORR 2008»
15 years 3 months ago
Scheduling Kalman Filters in Continuous Time
A set of N independent Gaussian linear time invariant systems is observed by M sensors whose task is to provide the best possible steady-state causal minimum mean square estimate o...
Jerome Le Ny, Eric Feron, Munther A. Dahleh