Sciweavers

19130 search results - page 149 / 3826
» Modelling multi-path problems
Sort
View
ECAI
2000
Springer
15 years 10 months ago
Solving Permutation Constraint Satisfaction Problems with Artificial Ants
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
Christine Solnon
FPL
2000
Springer
103views Hardware» more  FPL 2000»
15 years 10 months ago
Evaluation of Accelerator Designs for Subgraph Isomorphism Problem
Many applications can be modeled as subgraph isomorphism problems. However, this problem is generally NP-complete and difficult to compute. A custom computing circuit is a prospect...
Shuichi Ichikawa, Hidemitsu Saito, Lerdtanaseangth...
HPCN
1995
Springer
15 years 10 months ago
Exploiting massively parallel architectures for the solution of diffusion and propagation problems
Many problems in several fields like physics, chemistry, biology and engineering lack an analytical solution able to provide a satisfactory phenomena description. Then a numerical...
P. P. Delsanto, S. Biancotto, M. Scalerandi, Mauri...
AAAI
1996
15 years 7 months ago
Nearly Monotonic Problems: A Key to Effective FA/C Distributed Sensor Interpretation?
The fesractioncslly-Qcczdrrcate, cooperative (FA/C) distributed problem-solving paradigm is one approach for organizing distributed problem solving among homogeneous, cooperating ...
Norman Carver, Victor R. Lesser, Robert Whitehair
AIPS
1994
15 years 7 months ago
Solving Time-critical Decision-making Problems with Predictable Computational Demands
In this work we present an approach to solving time-critical decision-making problems by taking advantage of domain structure to expand the amountof time available for processing ...
Thomas Dean, Lloyd Greenwald