Sciweavers

506 search results - page 35 / 102
» Automated Search for Heuristic Functions
Sort
View
WSC
2008
13 years 10 months ago
Automating the constraining process
The typical approach to finding minimum levels of resources that still allow support and operational performance goals to be met for military aircraft is based on a manual trial-a...
Joel J. Luna
EICS
2010
ACM
13 years 5 months ago
An automated routine for menu structure optimization
We propose an automated routine for hierarchical menu structure optimization. A computer advice-giving system founded on the mathematical model of menu navigation directs the desi...
Mikhail V. Goubko, Alexander I. Danilenko
CONSTRAINTS
2007
122views more  CONSTRAINTS 2007»
13 years 7 months ago
Stochastic Local Search Algorithms for Graph Set T -colouring and Frequency Assignment
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
Marco Chiarandini, Thomas Stützle
DAC
2004
ACM
14 years 8 months ago
A recursive paradigm to solve Boolean relations
A recursive algorithm for solving Boolean relations is presented. It provides several features: wide exploration of solutions, parametrizable cost function and efficiency. The exp...
David Bañeres, Jordi Cortadella, Michael Ki...
AAAI
2010
13 years 9 months ago
Computationally Feasible Automated Mechanism Design: General Approach and Case Studies
In many multiagent settings, a decision must be made based on the preferences of multiple agents, and agents may lie about their preferences if this is to their benefit. In mechan...
Mingyu Guo, Vincent Conitzer