Sciweavers

1022 search results - page 181 / 205
» Challenges for Constraint Programming in Networking
Sort
View
106
Voted
CP
2007
Springer
15 years 6 months ago
Path Consistency by Dual Consistency
Dual Consistency (DC) is a property of Constraint Networks (CNs) which is equivalent, in its unrestricted form, to Path Consistency (PC). The principle is to perform successive sin...
Christophe Lecoutre, Stéphane Cardon, Julie...
120
Voted
IFIP
2004
Springer
15 years 5 months ago
Solving Packing Problem with Weaker Block Solvers
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
Hu Zhang
99
Voted
DATE
2010
IEEE
148views Hardware» more  DATE 2010»
15 years 4 months ago
Scoped identifiers for efficient bit aligned logging
Abstract--Detailed diagnostic data is a prerequisite for debugging problems and understanding runtime performance in distributed wireless embedded systems. Severe bandwidth limitat...
Roy Shea, Mani B. Srivastava, Young Cho
DAC
2009
ACM
15 years 4 months ago
RegPlace: a high quality open-source placement framework for structured ASICs
Structured ASICs have recently emerged as an exciting alternative to ASIC or FPGA design style as they provide a new trade-off between the high performance of ASIC design and low ...
Ashutosh Chakraborty, Anurag Kumar, David Z. Pan
99
Voted
IIWAS
2008
15 years 1 months ago
A model-prover for constrained dynamic conversations
In a service-oriented architecture, systems communicate by exchanging messages. In this work, we propose a formal model based on OCL-constrained UML Class diagrams and a methodolo...
Diletta Cacciagrano, Flavio Corradini, Rosario Cul...