8695 search results - page 406 / 1739 » Making the Complex Simple |
217
click to vote
ICALP
2000
Springer
15 years 11 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
194
click to vote
HPDC
1995
IEEE
15 years 11 months ago
1995
IEEE
A novel packet multiplexing technique, called Rotating-Priority-Queues (RPQ), is presented which exploits the tradeoff between high eficiency, i.e., the ability to support many co...
201
click to vote
ICLP
1995
Springer
15 years 11 months ago
1995
Springer
We present the wamcc system, a Prolog compiler that translates Prolog to C via the WAM. This approach has some interesting consequences: simplicity, efficiency, portability, exten...
186
click to vote
ISN
1995
Springer
15 years 11 months ago
1995
Springer
Over recent years, the need to introduce rapidly new telecommunications services has led to the development of the Intelligent Network (IN). These services and the increasingly com...
191
click to vote
ATAL
2008
Springer
15 years 9 months ago
2008
Springer
This article presents a multi-agent dialogue system. We show how a collection of relatively simple agents is able to treat complex dialogue phenomena and deal successfully with di...