Sciweavers

1884 search results - page 173 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
105
Voted
ICTAI
2007
IEEE
15 years 9 months ago
On Portfolios for Backtracking Search in the Presence of Deadlines
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...
Huayue Wu, Peter van Beek
127
Voted
WABI
2001
Springer
112views Bioinformatics» more  WABI 2001»
15 years 7 months ago
Finding an Optimal Inversion Median: Experimental Results
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...
Adam C. Siepel, Bernard M. E. Moret
118
Voted
STOC
1992
ACM
100views Algorithms» more  STOC 1992»
15 years 6 months ago
Biased Random Walks
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nath...
121
Voted
CGI
2004
IEEE
15 years 6 months ago
Fast and High Quality Overlap Repair for Patch-Based Texture Synthesis
Patch-based texture synthesis has proven to produce high quality textures faster than pixel-based approaches. Previous algorithms differ in how the regions of overlap between neig...
Andrew Nealen, Marc Alexa
123
Voted
AAAI
2004
15 years 4 months ago
Low-cost Addition of Preferences to DTPs and TCSPs
We present an efficient approach to adding soft constraints, in the form of preferences, to Disjunctive Temporal Problems (DTPs) and their subclass Temporal Constraint Satisfactio...
Bart Peintner, Martha E. Pollack