8780 search results - page 35 / 1756 » On the Feasibility of Consistent Computations |
MASA
2001
Springer
15 years 2 months ago
2001
Springer
An important aspect of agents is how they construct a plan to reach their goals. Since most agents live in a dynamic environment, they also will often be confronted with situations...
COR
2008
14 years 9 months ago
2008
The two-dimensional orthogonal packing problem (2OPP) consists in determining if a set of rectangles can be packed in a larger rectangle of fixed size. We propose an exact method ...
NIPS
2008
14 years 11 months ago
2008
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...
ICGA
2006
14 years 9 months ago
2006
In this note, the psychology of aesthetics is briefly discussed and the feasibility of a discrete computational aesthetics model for chess isjustified.
100
click to vote
SIGSOFT
2003
ACM
15 years 10 months ago
2003
ACM
This paper presents a novel approach for automated test data generation of imperative programs containing integer, boolean and/or float variables. It extends our previous work to ...