Sciweavers

1963 search results - page 232 / 393
» The Maximum Solution Problem on Graphs
Sort
View
156
Voted
DRMTICS
2005
Springer
15 years 6 months ago
Algorithms to Watermark Software Through Register Allocation
Software security is a significant issue in the Internet age. In order to prevent software from piracy and unauthorized modification, many techniques have been developed. Softwar...
William Zhu, Clark D. Thomborson
101
Voted
FUIN
2000
68views more  FUIN 2000»
15 years 18 days ago
Models For Dependable Computation with Multiple Inputs and Some Hardness Results
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
Yongge Wang, Yvo Desmedt, Mike Burmester
83
Voted
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
15 years 2 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
ICML
1996
IEEE
16 years 1 months ago
Learning Evaluation Functions for Large Acyclic Domains
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...
Justin A. Boyan, Andrew W. Moore
128
Voted
AMAI
2004
Springer
15 years 6 months ago
New Look-Ahead Schemes for Constraint Satisfaction
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
Kalev Kask, Rina Dechter, Vibhav Gogate