Sciweavers

4679 search results - page 324 / 936
» Modeling When Connections Are the Problem
Sort
View
FM
2001
Springer
118views Formal Methods» more  FM 2001»
16 years 1 days ago
Avoiding State Explosion for Distributed Systems with Timestamps
This paper describes a reduction technique which is very useful against the state explosion problem which occurs when model checking many distributed systems. Timestamps are often ...
Fabrice Derepas, Paul Gastin, David Plainfoss&eacu...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
16 years 25 days ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li
CONSTRAINTS
2011
15 years 2 months ago
Dantzig-Wolfe decomposition and branch-and-price solving in G12
Abstract The G12 project is developing a software environment for stating and solving combinatorial problems by mapping a high-level model of the problem to an efficient combinatio...
Jakob Puchinger, Peter J. Stuckey, Mark G. Wallace...
PERCOM
2004
ACM
16 years 7 months ago
A User-Guided Cognitive Agent for Network Service Selection in Pervasive Computing Environments
Connectivity is central to pervasive computing environments. We seek to catalyze a world of rich and diverse connectivity through technologies that drastically simplify the task o...
George Lee, Peyman Faratin, Steven Bauer, John Wro...
INFOCOM
2005
IEEE
16 years 1 months ago
Monotone percolation and the topology control of wireless networks
— This paper addresses the topology control problem for large wireless networks that are modelled by an infinite point process on a two-dimensional plane. Topology control is th...
Anxiao Jiang, Jehoshua Bruck