345 search results - page 52 / 69 » Computer-Assisted Simulation Proofs |
143
click to vote
RTA
2005
Springer
15 years 8 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
CF
2004
ACM
15 years 7 months ago
2004
ACM
Current processor and multiprocessor architectures are almost all based on the Von Neumann paradigm. Based on this paradigm, one can build a general-purpose computer using very fe...
113
click to vote
MABS
2004
Springer
15 years 7 months ago
2004
Springer
Since Holland (1993) introduced the concept of tags as a possible cooperation forming mechanism in evolving system (among other things) a number of tag models with intriguing, and ...
105
Voted
INFOCOM
2003
IEEE
15 years 7 months ago
2003
IEEE
Abstract— Finding a path in a network based on multiple constraints (the MCP problem) is often referred to as QoS routing. QoS routing with constraints on multiple additive metri...
DATE
2002
IEEE
15 years 7 months ago
2002
IEEE
Complex embedded systems consist of hardware and software components from different domains, such as control and signal processing, many of them supplied by different IP vendors. ...