1236 search results - page 82 / 248 » Prefix-Like Complexities and Computability in the Limit |
100
click to vote
EUROPAR
2004
Springer
15 years 3 months ago
2004
Springer
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing answers to subgoals. The declarative nature of tabled logic program...
RTSS
2003
IEEE
15 years 3 months ago
2003
IEEE
Consensus is known to be a fundamental problem in fault-tolerant distributed systems. Solving this problem provides the means for distributed processes to agree on a single value....
FIDJI
2003
Springer
15 years 3 months ago
2003
Springer
The UML has become the de facto standard for the analysis and design of complex software. Tool support today includes the generation of code realizing the structural model describe...
CEC
2009
IEEE
15 years 2 months ago
2009
IEEE
— Interested in Evolutionary Robotics, this paper focuses on the acquisition and exploitation of memory skills. The targeted task is a well-studied benchmark problem, the Tolman ...
EUROMICRO
2000
IEEE
15 years 2 months ago
2000
IEEE
The complexity of embedded systems is increasing rapidly. In consequence, new verification techniques that overcome the limitations of traditional methods and are suitable for har...