Sciweavers

1615 search results - page 230 / 323
» Computer science and decision theory
Sort
View
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
15 years 3 months ago
Solving satisfiability problems with preferences
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
STOC
2009
ACM
152views Algorithms» more  STOC 2009»
16 years 1 months ago
Green's conjecture and testing linear-invariant properties
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
Asaf Shapira
AAMAS
2010
Springer
15 years 6 months ago
Evolutionary mechanism design: a review
Abstract The advent of large-scale distributed systems poses unique engineering challenges. In open systems such as the internet it is not possible to prescribe the behaviour of al...
Steve Phelps, Peter McBurney, Simon Parsons
CORR
2008
Springer
157views Education» more  CORR 2008»
15 years 6 months ago
The Imaginary Sliding Window As a New Data Structure for Adaptive Algorithms
Abstract.1 The scheme of the sliding window is known in Information Theory, Computer Science, the problem of predicting and in stastistics. Let a source with unknown statistics gen...
Boris Ryabko
IEEECIT
2010
IEEE
15 years 4 months ago
An Innovative Course about Network Storage and System Virtualization Technologies in PKU
—“Network Storage and System Virtualization Technologies” is an up-to-date course opened by the school of electronics engineering and computer science of Peking University. T...
Xiaolin Wang, Xinxin Jin, Yingwei Luo, Zhenlin Wan...