971 search results - page 116 / 195 » Approximate Satisfiability and Equivalence |
ASPDAC
1999
ACM
15 years 5 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
127
click to vote
INFOVIS
1999
IEEE
15 years 5 months ago
1999
IEEE
Dynamic Queries offer continuous feedback during range queries, and have been shown to be effective and satisfying. Recent work has extended them to datasets of 100,000 objects an...
FLAIRS
2000
15 years 2 months ago
2000
Behaviour of systems is described by formal languages: the sets of all sequences of actions. Regarding ion, alphabetic language homomorphisms are compute abstract behaviours. To a...
85
Voted
CORR
2010
Springer
15 years 27 days ago
2010
Springer
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage c...
100
click to vote
DISOPT
2008
15 years 26 days ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...