Sciweavers

2657 search results - page 477 / 532
» On the complexity of hierarchical problem solving
Sort
View
ACSC
2005
IEEE
14 years 2 months ago
A Two-Pronged Attack on the Dragon of Intractability
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...
Stephen Gilmour, Mark Dras
ICDCS
2005
IEEE
14 years 2 months ago
A Dynamic Group Mutual Exclusion Algorithm Using Surrogate-Quorums
The group mutual exclusion problem extends the traditional mutual exclusion problem by associating a type with each critical section. In this problem, processes requesting critica...
Ranganath Atreya, Neeraj Mittal
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
14 years 2 months ago
Intransitivity revisited coevolutionary dynamics of numbers games
Relative fitness, or “evaluation by tests” is one of the building blocks of coevolution: the only fitness information available is a comparison with other individuals in a p...
Pablo Funes, Enrique Pujals
MOBICOM
2003
ACM
14 years 2 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
14 years 2 months ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...