245 search results - page 36 / 49 » Locating phase transitions in computationally hard problems |
SIGMETRICS
2010
ACM
14 years 11 days ago
2010
ACM
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
Object detection in clutter or occlusion is a hard problem in computer vision. We propose an object detection method based on contour grouping. Two stages are included: a novel di...
HUC
2007
Springer
14 years 1 months ago
2007
Springer
Context-aware power management (CAPM) uses context (e.g., user location) likely to be available in future ubiquitous computing environments, to effectively power manage a building...
SIGECOM
2010
ACM
13 years 7 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
AI
2008
Springer
13 years 7 months ago
2008
Springer
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...