Sciweavers

5022 search results - page 791 / 1005
» Data structures and problem solving using Java
Sort
View
106
Voted
INFOCOM
2005
IEEE
15 years 8 months ago
Mobile-assisted localization in wireless sensor networks
Abstract— The localization problem is to determine an assignment of coordinates to nodes in a wireless ad-hoc or sensor network that is consistent with measured pairwise node dis...
Nissanka B. Priyantha, Hari Balakrishnan, Erik D. ...
DEDS
2002
119views more  DEDS 2002»
15 years 2 months ago
Diagnosing Discrete-Event Systems: Extending the "Diagnoser Approach" to Deal with Telecommunication Networks
Abstract. Detection and isolation of failures in large and complex systems such as telecommunication networks are crucial and challenging tasks. The problem considered here is that...
Laurence Rozé, Marie-Odile Cordier
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
15 years 6 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...
139
Voted
AGENTS
2001
Springer
15 years 6 months ago
Matchmaking among minimal agents without a facilitator
Multi-Agent Systems are a promising way of dealing with large complex problems. However, it is not yet clear just how much complexity or pre-existing structure individual agents m...
Elth Ogston, Stamatis Vassiliadis
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 5 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...