Sciweavers

9626 search results - page 1341 / 1926
» Invariant Based Programming
Sort
View
CP
2009
Springer
16 years 7 months ago
Asynchronous Inter-Level Forward-Checking for DisCSPs
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
Redouane Ezzahir, Christian Bessiere, Mohamed Wahb...
VLSID
2002
IEEE
160views VLSI» more  VLSID 2002»
16 years 7 months ago
An Efficient Hierarchical Timing-Driven Steiner Tree Algorithm for Global Routing
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
Jingyu Xu, Xianlong Hong, Tong Jing, Yici Cai, Jun...
CHI
2003
ACM
16 years 7 months ago
Fusion: interactive coordination of diverse data, visualizations, and mining algorithms
Fusion is a web-based system that enables end-users to rapidly and dynamically construct personalized visualization workspaces without programming. Users first use advanced data s...
Chris North, Nathan Conklin, Kiran Indukuri, Varun...
CADE
2005
Springer
16 years 7 months ago
A Focusing Inverse Method Theorem Prover for First-Order Linear Logic
We present the theory and implementation of a theorem prover for first-order intuitionistic linear logic based on the inverse method. The central proof-theoretic insights underlyin...
Kaustuv Chaudhuri, Frank Pfenning
STOC
2005
ACM
167views Algorithms» more  STOC 2005»
16 years 7 months ago
Approximately counting integral flows and cell-bounded contingency tables
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
Mary Cryan, Martin E. Dyer, Dana Randall
« Prev « First page 1341 / 1926 Last » Next »