2300 search results - page 358 / 460 » Maximally Concurrent Programs |
100
click to vote
CG
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. In this paper we review the conventional versions of nullmove pruning, and present our enhancements which allow for a deeper search with greater accuracy. While the conve...
136
Voted
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
We study the combinatorial auction (CA) problem, in which m objects are sold to rational agents and the goal is to maximize social welfare. Of particular interest is the special ca...
135
click to vote
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Guided Abstraction Simplification Roberto Giacobazzi1 and Francesco Ranzato2 1 University of Verona, Italy 2 University of Padova, Italy Abstract. In static analysis, approximation...
131
click to vote
NIPS
2004
15 years 3 months ago
2004
We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, ...
79
Voted
NIPS
2003
15 years 3 months ago
2003
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...