15033 search results - page 373 / 3007 » Complexity Theory and Algorithms |
228
click to vote
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
This paper presents a methodology for using heuristic search methods to optimise cancer chemotherapy. Specifically, two evolutionary algorithms - Population Based Incremental Lear...
281
click to vote
POPL
2003
ACM
16 years 7 months ago
2003
ACM
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
177
Voted
EUSFLAT
2001
15 years 8 months ago
2001
One of the biggest problems in computer vision systems, analyzing images having high uncertainty/vagueness degree, is the treatment of such uncertainty. This problem is even clear...
209
Voted
AAAI
1997
15 years 8 months ago
1997
CNF-BCP is a well-known propositional reasoner that extends clausal Boolean Constraint Propagation (BCP) to non-clausal theories. Although BCP has efficient linear-time implementa...
205
click to vote
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...