1662 search results - page 285 / 333 » The Computational Complexity of Agent Design Problems |
TASE
2008
IEEE
13 years 8 months ago
2008
IEEE
In this paper we deal with the problem of modeling railway networks with Petri nets so as to apply the theory of supervisory control for discrete event systems to automatically de...
IVC
2007
13 years 8 months ago
2007
Establishing the correct correspondence between features in an image set remains a challenging problem amongst computer vision researchers. In fact, the combinatorial nature of fe...
CN
2002
13 years 8 months ago
2002
Abstract-The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of...
INFORMS
1998
13 years 8 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
FLOPS
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...