Sciweavers

5100 search results - page 787 / 1020
» The Linear Complexity of a Graph
Sort
View
CGO
2008
IEEE
15 years 8 months ago
Comprehensive path-sensitive data-flow analysis
Data-flow analysis is an integral part of any aggressive optimizing compiler. We propose a framework for improving the precision of data-flow analysis in the presence of complex c...
Aditya V. Thakur, R. Govindarajan
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
15 years 8 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
ATMOS
2008
139views Optimization» more  ATMOS 2008»
15 years 8 months ago
Efficient On-Trip Timetable Information in the Presence of Delays
Abstract. The search for train connections in state-of-the-art commercial timetable information systems is based on a static schedule. Unfortunately, public transportation systems ...
Lennart Frede, Matthias Müller-Hannemann, Mat...
SIROCCO
2008
15 years 7 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...
SAC
2010
ACM
15 years 6 months ago
Graph-based verification of static program constraints
Software artifacts usually have static program constraints and these constraints should be satisfied in each reuse. In addition to this, the developers are also required to satisf...
Selim Ciraci, Pim van den Broek, Mehmet Aksit