Sciweavers

664 search results - page 34 / 133
» Solution to the Counterfeit Coin Problem and its Generalizat...
Sort
View
AIPS
2004
14 years 11 months ago
Iterative Relaxations for Iterative Flattening in Cumulative Scheduling
Cumulative scheduling is a generalization of jobshop scheduling, where machines have discrete capacities and activities may require several capacity units. This paper considers it...
Laurent Michel, Pascal Van Hentenryck
TSP
2008
122views more  TSP 2008»
14 years 9 months ago
Quality of Service and Max-Min Fair Transmit Beamforming to Multiple Cochannel Multicast Groups
The problem of transmit beamforming to multiple cochannel multicast groups is considered, when the channel state is known at the transmitter and from two viewpoints: minimizing tot...
Eleftherios Karipidis, Nikos D. Sidiropoulos, Zhi-...
GECCO
2007
Springer
176views Optimization» more  GECCO 2007»
15 years 4 months ago
Best SubTree genetic programming
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
Oana Muntean, Laura Diosan, Mihai Oltean
CORR
2010
Springer
178views Education» more  CORR 2010»
14 years 7 months ago
Adaptive Algorithms for Coverage Control and Space Partitioning in Mobile Robotic Networks
We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends ...
Jerome Le Ny, George J. Pappas
SIAMCO
2008
130views more  SIAMCO 2008»
14 years 9 months ago
Important Moments in Systems and Control
The moment problem matured from its various special forms in the late 19th and early 20th Centuries to a general class of problems that continues to exert profound influence on the...
Christopher I. Byrnes, Anders Lindquist