1884 search results - page 272 / 377 » Simple Algorithm for Simple Timed Games |
103
click to vote
DAC
2007
ACM
16 years 3 months ago
2007
ACM
The ability of modern SAT solvers to produce proofs of unsatisfiability for Boolean formulas has become a powerful tool for EDA applications. Proofs are generated from a resolve t...
246
Voted
CC
2009
Springer
16 years 2 months ago
2009
Springer
form uses a notational abstractions called -functions. These instructions have no analogous in actual machine instruction sets, and they must be replaced by ordinary instructions ...
CHI
2007
ACM
16 years 2 months ago
2007
ACM
A new method for adapting digital images so that they are suitable for color blind viewers is presented. In contrast to earlier automatic methods which formulate the problem of ad...
STOC
2001
ACM
16 years 2 months ago
2001
ACM
In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absor...
128
click to vote
CIAC
2010
Springer
15 years 11 months ago
2010
Springer
In this paper we consider a natural generalization of the well-known Max Leaf
Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as
input an undirected co...