6455 search results - page 374 / 1291 » Research problems |
170
click to vote
IJCAI
2001
15 years 8 months ago
2001
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
201
click to vote
TSE
2010
15 years 1 months ago
2010
Search-based software engineering is an emerging paradigm that uses automated search algorithms to help designers iteratively find solutions to complicated design problems. For exa...
197
click to vote
ECCV
2004
Springer
16 years 4 days ago
2004
Springer
Recent research provided several new and fast approaches for the class of parameter estimation problems that are common in computer vision. Incorporation of complex noise model (mo...
197
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper presents the design and implementation of an adaptive open-set speaker identification system with genetic learning classifier systems. One of the challenging problems i...
171
click to vote
CPM
2009
Springer
16 years 1 months ago
2009
Springer
The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer interv...