4305 search results - page 355 / 861 » The Test of Time |
161
click to vote
LCTRTS
2005
Springer
16 years 10 days ago
2005
Springer
Debugging, testing, and profiling microcontroller programs are notoriously difficult. The lack of supporting software such as an operating system, a narrow interface to the hard...
196
click to vote
QOSIP
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...
187
click to vote
EUROGP
2004
Springer
16 years 7 days ago
2004
Springer
The paper presents for the first time automatic module acquisition and evolution within the graph based Cartesian Genetic Programming method. The method has been tested on a set of...
175
click to vote
SAT
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. Recently Schuler [17] presented a randomized algorithm that solves SAT in expected time at most 2n(1−1/ log2(2m)) up to a polynomial factor, where n and m are, respecti...
185
click to vote
ICANN
2003
Springer
16 years 1 days ago
2003
Springer
We propose a simple method to map a generic threshold model, namely the Spike Response Model, to artificial data of neuronal activity using a minimal amount of a priori informatio...