Sciweavers

1483 search results - page 105 / 297
» Geometric constraint satisfaction using optimization methods
Sort
View
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 1 months ago
Distributed Constrained Optimization with Semicoordinate Transformations
Recent work has shown how information theory extends conventional full-rationality game theory to allow bounded rational agents. The associated mathematical framework can be used ...
William G. Macready, David Wolpert
IUI
2004
ACM
15 years 6 months ago
SUPPLE: automatically generating user interfaces
In order to give people ubiquitous access to software applications, device controllers, and Internet services, it will be necessary to automatically adapt user interfaces to the c...
Krzysztof Gajos, Daniel S. Weld
AAAI
2007
15 years 3 months ago
Nonmyopic Informative Path Planning in Spatio-Temporal Models
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
Alexandra Meliou, Andreas Krause, Carlos Guestrin,...
CP
2006
Springer
15 years 5 months ago
A New Algorithm for Sampling CSP Solutions Uniformly at Random
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
Vibhav Gogate, Rina Dechter
GECCO
2007
Springer
163views Optimization» more  GECCO 2007»
15 years 7 months ago
Effects of the use of non-geometric binary crossover on evolutionary multiobjective optimization
In the design of evolutionary multiobjective optimization (EMO) algorithms, it is important to strike a balance between diversity and convergence. Traditional mask-based crossover...
Hisao Ishibuchi, Yusuke Nojima, Noritaka Tsukamoto...