500 search results - page 56 / 100 » Asynchronous Search with Aggregations |
126
click to vote
APN
2004
Springer
15 years 8 months ago
2004
Springer
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
146
click to vote
ICDCS
2000
IEEE
15 years 7 months ago
2000
IEEE
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...
128
click to vote
AMET
1998
Springer
15 years 7 months ago
1998
Springer
We present a simple and uniform communication framework for an agent-based market infrastructure, the goal of which is to enable automation of consumer goods markets distributed ov...
128
click to vote
ANTSW
2006
Springer
15 years 7 months ago
2006
Springer
There are two reasons for parallelizing a metaheuristic if one is interested in performance: (i) given a fixed time to search, the aim is to increase the quality of the solutions f...
116
click to vote
IJCAI
1989
15 years 4 months ago
1989
This paper describes SYNAPSIS, a parser for performing real-time understanding of spoken utterances in a parallel computational environment. Understanding continuous speech allowi...