Sciweavers

110 search results - page 15 / 22
» Interleaved Depth-First Search
Sort
View
CHI
2007
ACM
14 years 8 months ago
InkSeine: In Situ search for active note taking
Using a notebook to sketch designs, reflect on a topic, or capture and extend creative ideas are examples of active note taking tasks. Optimal experience for such tasks demands co...
Ken Hinckley, Shengdong Zhao, Raman Sarin, Patrick...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 8 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
CP
2005
Springer
14 years 2 months ago
Mind the Gaps: A New Splitting Strategy for Consistency Techniques
Classical methods for solving numerical CSPs are based on a branch and prune algorithm, a dichotomic enumeration process interleaved with a consistency filtering algorithm. In man...
Heikel Batnini, Claude Michel, Michel Rueher
POPL
2005
ACM
14 years 8 months ago
Dynamic partial-order reduction for model checking software
We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring an arbitrary interleaving of the various concurrent...
Cormac Flanagan, Patrice Godefroid
ICTAI
2009
IEEE
14 years 3 months ago
Enhanced Inference for the Market Split Problem
Inference in constraint programming is usually based on the deductions generated by individual constraints which are then communicated to other constraints through domain filteri...
Tarik Hadzic, Eoin O'Mahony, Barry O'Sullivan, Mei...