Sciweavers

4372 search results - page 400 / 875
» Algorithmic Theories of Everything
Sort
View
CAV
2007
Springer
116views Hardware» more  CAV 2007»
16 years 1 months ago
A Decision Procedure for Bit-Vectors and Arrays
Abstract. STP is a decision procedure for the satisfiability of quantifier-free formulas in the theory of bit-vectors and arrays that has been optimized for large problems encoun...
Vijay Ganesh, David L. Dill
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
16 years 1 months ago
Constant Factor Approximations for the Hotlink Assignment Problem
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
Tobias Jacobs
WDAG
2007
Springer
86views Algorithms» more  WDAG 2007»
16 years 1 months ago
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
CRV
2006
IEEE
90views Robotics» more  CRV 2006»
16 years 28 days ago
Photo Hull Regularized Stereo
A regularization-based approach to 3-D reconstruction from multiple images is proposed. As one of the most widely used multiple-view 3-D reconstruction algorithms, Space Carving c...
Shufei Fan, Frank P. Ferrie
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
16 years 25 days ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert