Sciweavers

653 search results - page 69 / 131
» The size of minimum 3-trees
Sort
View
COCOON
2004
Springer
15 years 11 months ago
Coloring Octrees
An octree is a recursive partition of the unit cube, such that in each step a cube is subdivided into eight smaller cubes. Those cubes that are not further subdivided are the leave...
Udo Adamy, Michael Hoffmann, József Solymos...
CP
2004
Springer
15 years 11 months ago
Deriving Filtering Algorithms from Constraint Checkers
Abstract. This article deals with global constraints for which the set of solutions can be recognized by an extended finite automaton whose size is bounded by a polynomial in n, w...
Nicolas Beldiceanu, Mats Carlsson, Thierry Petit
COMPSAC
2003
IEEE
15 years 11 months ago
Variable Strength Interaction Testing of Components
Complete interaction testing of components is too costly in all but the smallest systems. Yet component interactions are likely to cause unexpected faults. Recently, design of exp...
Myra B. Cohen, Peter B. Gibbons, Warwick B. Mugrid...
INFOCOM
2003
IEEE
15 years 11 months ago
Distributed Network Monitoring with Bounded Link Utilization in IP Networks
— Designing optimal measurement infrastructure is a key step for network management. In this work we address the problem of optimizing a scalable distributed polling system. The ...
Erran L. Li, Marina Thottan, Bin Yao, Sanjoy Paul
MSWIM
2003
ACM
15 years 11 months ago
Connectivity of wireless multihop networks in a shadow fading environment
This article analyzes the connectivity of multihop radio networks in a log-normal shadow fading environment. Assuming the nodes have equal transmission capabilities and are randoml...
Christian Bettstetter, Christian Hartmann