797 search results - page 99 / 160 » Observing Success in the Pi-Calculus |
161
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Spectral clustering is one of the most widely used techniques for extracting the underlying global structure of a data set. Compressed sensing and matrix completion have emerged a...
191
click to vote
EC
2008
15 years 6 months ago
2008
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
151
click to vote
AES
2006
Springer
15 years 6 months ago
2006
Springer
This paper describes the development and application of a piece of engineering software that provides a Problem Solving Environment (PSE) capable of launching, and interfacing wit...
154
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We address the problem of autonomously learning controllers for visioncapable mobile robots. We extend McCallum's (1995) Nearest-Sequence Memory algorithm to allow for genera...
176
click to vote
DAM
2006
15 years 6 months ago
2006
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...