1197 search results - page 10 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
PTS
2010
13 years 6 months ago
2010
Recently there has been an upsurge of interest in both, Search– Based Software Testing (SBST), and Dynamic Symbolic Execution (DSE). Each of these two approaches has complementar...
CAD
2006
Springer
13 years 8 months ago
2006
Springer
In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition, a geometric constraint problem can be reduc...
CSCLP
2006
Springer
13 years 11 months ago
2006
Springer
Real-life problems present several kinds of preferences. We focus on problems with both positive and negative preferences, that we call bipolar preference problems. Although seemin...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
— Chemotaxis can be defined as an innate behavioural response by an organism to a directional stimulus, in which bacteria, and other single-cell or multicellular organisms direct...
NORDICHI
2004
ACM
14 years 1 months ago
2004
ACM
This paper describes how computer-human interaction in ambient computing environments can be best informed by conceptualizing of such environments as problem solving systems. Typi...