4894 search results - page 575 / 979 » The Guarding Problem - Complexity and Approximation |
141
click to vote
AAAI
1996
15 years 6 months ago
1996
In recent years, compositional modeling and selfexplanatory simulation techniques have simplified the process of building dynamic simulators of physical systems. Building steady-s...
118
click to vote
DAGSTUHL
1990
15 years 5 months ago
1990
A connectionist model for robust reasoning, CONSYDERR, is proposed to account for some common reasoning patterns found in commonsense reasoning and to remedy the brittleness probl...
141
Voted
ESA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We study the problem of designing group-strategyproof costsharing mechanisms. The players report their bids for getting serviced and the mechanism decides a set of player...
158
click to vote
GRC
2010
IEEE
15 years 5 months ago
2010
IEEE
We present a problem of factor analysis of three-way binary data, i.e. data described by a 3-dimensional binary matrix I, describing a relationship between objects, attributes, an...
133
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...