Sciweavers

1284 search results - page 254 / 257
» Data Structures for Mergeable Trees
Sort
View
CPAIOR
2009
Springer
14 years 5 months ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin
INFOCOM
2008
IEEE
14 years 5 months ago
Sensor-Aided Overlay Deployment and Relocation for Vast-Scale Sensor Networks
—The overlay-based network architecture has been recognized as an effective way to deal with the funneling effect in sensor networks, where sensors closer to the sink are usually...
Guanqun Yang, Bin Tong, Daji Qiao, Wensheng Zhang
DDECS
2007
IEEE
175views Hardware» more  DDECS 2007»
14 years 5 months ago
Analyzing Test and Repair Times for 2D Integrated Memory Built-in Test and Repair
—An efficient on-chip infrastructure for memory test and repair is crucial to enhance yield and availability of SoCs. A commonly used repair strategy is to equip memories with sp...
Philipp Öhler, Sybille Hellebrand, Hans-Joach...
DEXA
2007
Springer
154views Database» more  DEXA 2007»
14 years 5 months ago
Beyond Lazy XML Parsing
XML has become the standard format for data representation and exchange in domains ranging from Web to desktop applications. However, wide adoption of XML is hindered by inefficien...
Fernando Farfán, Vagelis Hristidis, Raju Ra...
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
14 years 5 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan