Sciweavers

3628 search results - page 188 / 726
» The Decision Diffie-Hellman Problem
Sort
View
124
Voted
EOR
2006
88views more  EOR 2006»
15 years 3 months ago
Nonessential objectives within network approaches for MCDM
In Gal and Hanne [Eur. J. Oper. Res. 119 (1999) 373] the problem of using several methods to solve a multiple criteria decision making (MCDM) problem with linear objective functio...
Tomas Gal, Thomas Hanne
155
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
Practical Scheduling Algorithms for Concurrent Transmissions in Rate-adaptive Wireless Networks
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
Zhe Yang, Lin Cai, Wu-sheng Lu
107
Voted
DGCI
2006
Springer
15 years 7 months ago
Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard
This paper deals with the complexity of the decomposition of a digital surface into digital plane segments (DPS for short). We prove that the decision problem (does there exist a ...
Isabelle Sivignon, David Coeurjolly
227
Voted
CISIS
2011
IEEE
14 years 3 months ago
Agent-based Pickup and Delivery Planning: The Learnable Evolution Model Approach
—The Dynamic Vehicle Routing Problem (DVRP) is an optimization problem in which agents deliver orders that are not known in advance to the routing. Partial solutions need to be a...
Janusz Wojtusiak, Tobias Warden, Otthein Herzog
ATAL
2005
Springer
15 years 9 months ago
A cooperative multi-agent approach to free flight
The next generation of air traffic control will require automated decision support systems in order to meet safety, reliability, flexibility, and robustness demands in an environ...
Jared C. Hill, F. Ryan Johnson, James K. Archibald...