Sciweavers

785 search results - page 59 / 157
» Binary Join Trees
Sort
View
ICCAD
2010
IEEE
158views Hardware» more  ICCAD 2010»
14 years 7 months ago
Novel binary linear programming for high performance clock mesh synthesis
Clock mesh is popular in high performance VLSI design because it is more robust against variations than clock tree at a cost of higher power consumption. In this paper, we propose ...
Minsik Cho, David Z. Pan, Ruchir Puri
TCS
2002
14 years 9 months ago
Binary (generalized) Post Correspondence Problem
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
Vesa Halava, Tero Harju, Mika Hirvensalo
ADBIS
1994
Springer
87views Database» more  ADBIS 1994»
15 years 2 months ago
Variations of R-Tree Structure for Indexing of Spatial Objects
The data structures suitable for indexing of large spatial objects in databases are considered. Some generalizations of existing tree methods concerned approximation of spatial ob...
M. G. Martynov
EWSN
2008
Springer
15 years 9 months ago
Lifetime Maximization in Wireless Sensor Networks by Distributed Binary Search
We consider the problem of determining the transmission power assignment that maximizes the lifetime of a data-gathering wireless sensor network with stationary nodes and static tr...
André Schumacher, Harri Haanpää, ...
CP
2006
Springer
15 years 1 months ago
Reasoning by Dominance in Not-Equals Binary Constraint Networks
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
Belaid Benhamou, Mohamed Réda Saïdi