1206 search results - page 195 / 242 » Arc-Flags in Dynamic Graphs |
IPSN
2004
Springer
14 years 2 months ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
VRML
2003
ACM
14 years 1 months ago
2003
ACM
Success of 3D applications on the Web inherently depends on object behavior and interaction. Current Web3D formats often fall short in supporting behavior modeling. This paper int...
ICSE
2000
IEEE-ACM
14 years 8 days ago
2000
IEEE-ACM
Well engineered Web based courseware and exercises provide flexibility and added value to the students, which goes beyond the traditional text book or CD-ROM based courses. The Mu...
COCOA
2008
Springer
13 years 10 months ago
2008
Springer
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...