7228 search results - page 438 / 1446 » From Algorithmic to Subjective Randomness |
163
Voted
COCO
2009
Springer
15 years 10 months ago
2009
Springer
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
176
click to vote
GISCIENCE
2008
Springer
15 years 7 months ago
2008
Springer
Movement patterns, like flocking and converging, leading and following, are examples of high-level process knowledge derived from lowlevel trajectory data. Conventional techniques...
170
click to vote
AI
2002
Springer
15 years 6 months ago
2002
Springer
TD-Gammon is a neural network that is able to teach itself to play backgammon solely by playing against itself and learning from the results. Starting from random initial play, TD...
214
click to vote
AAAI
2000
15 years 8 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
152
click to vote
ICDCIT
2005
Springer
16 years 9 days ago
2005
Springer
An algorithm for time division multiple access (TDMA) is desirable in sensor networks for energy management, as it allows a sensor to reduce the amount of idle listening. Also, TD...