2413 search results - page 159 / 483 » Understanding the problem |
129
click to vote
ICML
1997
IEEE
16 years 5 months ago
1997
IEEE
Abstract: We investigate the structure of model selection problems via the bias/variance decomposition. In particular, we characterize the essential structure of a model selection ...
130
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Software testing can be re-formulated as a search problem, hence search algorithms (e.g., Genetic Algorithms) can be used to tackle it. Most of the research so far has been of emp...
157
click to vote
FOCI
2007
IEEE
15 years 11 months ago
2007
IEEE
— The Constraint Satisfaction Problem (CSP) is one of the most prominent problems in artificial intelligence, logic, theoretical computer science, engineering and many other are...
131
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
129
click to vote
SBIA
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Enterprise delegates Agents’ Negotiation is a simpler task if the enterprises involved in the transaction have homogeneous representation structures as well as the same...