15033 search results - page 2668 / 3007 » Complexity Theory and Algorithms |
155
click to vote
COCOA
2007
Springer
16 years 27 days ago
2007
Springer
: We develop a new approach to combinatorial games (e.g., chess, Go, checkers, Chomp, Nim) that unveils connections between such games and nonlinear phenomena commonly seen in natu...
178
click to vote
COLT
2007
Springer
16 years 27 days ago
2007
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
163
Voted
CP
2007
Springer
16 years 27 days ago
2007
Springer
: This report introduces a geometrical constraint kernel for handling the location in space and time of polymorphic k-dimensional objects subject to various geometrical and time co...
175
Voted
CP
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. This paper deals with the problem of solving efficiently structured CSPs. It is well known that (hyper)tree-decompositions offer the best approaches from a theoretical v...
167
Voted
DCOSS
2007
Springer
16 years 27 days ago
2007
Springer
This paper presents a Connectivity based Partition Approach (CPA) to reduce the energy consumption of a sensor network by sleep scheduling among sensor nodes. CPA partitions sensor...