10051 search results - page 388 / 2011 » A Dynamic Separator Algorithm |
200
click to vote
CP
2008
Springer
15 years 9 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
199
click to vote
TIT
2008
15 years 7 months ago
2008
We are interested in the connection-level stability of a network employing congestion control. In particular, we study how the stability region of the network (i.e., the set of off...
559
click to vote
ICA
2012
Springer
14 years 3 months ago
2012
Springer
Independent component analysis (ICA) is possibly the most widespread approach to solve the blind source separation (BSS) problem. Many different algorithms have been proposed, tog...
204
click to vote
INFOCOM
2003
IEEE
16 years 24 days ago
2003
IEEE
— Channel-aware scheduling strategies, such as the Proportional Fair algorithm for the CDMA 1xEV-DO system, provide an effective mechanism for improving throughput performance in...
191
click to vote
AIPS
2007
15 years 9 months ago
2007
Autonomous systems operating in real-world environments must be able to plan, schedule, and execute missions while robustly adapting to uncertainty and disturbances. Previous work...