Sciweavers

836 search results - page 121 / 168
» On the Complexity of Train Assignment Problems
Sort
View
GECCO
2000
Springer
168views Optimization» more  GECCO 2000»
15 years 7 months ago
A Fault-tolerant Multicast Routing Algorithm in ATM Networks
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
Sam Kwong, S. S. Chan
CSL
2008
Springer
15 years 5 months ago
Quantitative Languages
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
144
Voted
AAAI
2004
15 years 5 months ago
A Comparison of Techniques for Scheduling Earth Observing Satellites
Scheduling observations by coordinated fleets of Earth Observing Satellites (EOS) involves large search spaces, complex constraints and poorly understood bottlenecks; conditions w...
Al Globus, James Crawford, Jason D. Lohn, Anna Pry...
CIC
2006
156views Communications» more  CIC 2006»
15 years 5 months ago
The Impact of Clustering in Distributed Topology Control
Abstract-- Topology control is the problem of assigning power levels to the nodes of an ad hoc network so as to maintain a specified network topology while minimizing energy consum...
Liang Zhao, Errol L. Lloyd
AIPS
1996
15 years 5 months ago
Modeling Probabilistic Actions for Practical Decision-Theoretic Planning
Mostexisting decision-theoretic planners represent uncertainty about the state of the world with a precisely specified probability distribution over world states. This representat...
AnHai Doan