1888 search results - page 79 / 378 » Proof theory and computational analysis |
108
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
101
click to vote
TCS
2008
15 years 11 days ago
2008
The object of this paper is to appreciate the computational limits inherent in the combinatorics of an applied concurrent (aka agent-based) language . That language is primarily m...
105
click to vote
TKDE
2002
15 years 3 days ago
2002
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
132
Voted
JCSC
1998
15 years 4 days ago
1998
: Continuous and hybrid Petri nets can be seen as relaxation of discrete nets, in which the firing of some or of all transitions is approximated with a fluid model. Several analysi...
129
Voted
CADE
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In the context of deductive program verification, supporting floatingpoint computations is tricky. We propose an expressive language to formally specify behavioral proper...