Sciweavers

838 search results - page 90 / 168
» Finding Optimal Solutions to Atomix
Sort
View
ECAI
2006
Springer
15 years 3 months ago
An Efficient Upper Approximation for Conditional Preference
The fundamental operation of dominance testing, i.e., determining if one alternative is preferred to another, is in general very hard for methods of reasoning with qualitative cond...
Nic Wilson
AISB
1995
Springer
15 years 3 months ago
The Ant Colony Metaphor for Searching Continuous Design Spaces
This paper describes a form of dynamical computational system--4he ant colony---and presents an ant colony model for continuous space optimisation problems. The ant colony metapho...
George Bilchev, Ian C. Parmee
ETD2000
1995
15 years 3 months ago
Automatic generation of a neural network architecture using evolutionary computation
This paper reports the application of evolutionary computation in the automatic generation of a neural network architecture.It is a usual practice to use trial and error to find a...
E. Vonk, Lakhmi C. Jain, L. P. J. Veelenturf, R. J...
ATAL
2008
Springer
15 years 1 months ago
Combining Job and Team Selection Heuristics
In open markets and within business and government organizations, selfish agents often face the question of what tasks to work on, and what partners to work with. Optimal solutions...
Chris L. D. Jones, K. Suzanne Barber
ASPDAC
2005
ACM
114views Hardware» more  ASPDAC 2005»
15 years 1 months ago
Redundant-via enhanced maze routing for yield improvement
- Redundant via insertion is a good solution to reduce the yield loss by via failure. However, the existing methods are all post-layout optimizations that insert redundant via afte...
Gang Xu, Li-Da Huang, David Z. Pan, Martin D. F. W...