Sciweavers

2376 search results - page 274 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
MICS
2008
72views more  MICS 2008»
13 years 9 months ago
Dynamic Multi-level Overlay Graphs for Shortest Paths
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...
Francesco Bruera, Serafino Cicerone, Gianlorenzo D...
CGF
2006
106views more  CGF 2006»
13 years 9 months ago
Silhouette Extraction in Hough Space
Object-space silhouette extraction is an important problem in fields ranging from non-photorealistic computer graphics to medical robotics. We present an efficient silhouette extr...
Matt Olson, Hao Zhang 0002
CAD
2005
Springer
13 years 9 months ago
Precise global collision detection in multi-axis NC-machining
We introduce a new approach to the problem of collision detection in multi-axis NC-machining. Due to the directional nature (tool axis) of multi-axis NCmachining, space subdivisio...
Oleg Ilushin, Gershon Elber, Dan Halperin, Ron Wei...
AIPS
2006
13 years 11 months ago
Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
Mark F. Rogers, Adele E. Howe, Darrell Whitley
ENTCS
2008
85views more  ENTCS 2008»
13 years 9 months ago
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
Salvador Lucas, Rafael Navarro-Marset