743 search results - page 57 / 149 » Solving the Multiple-Instance Problem: A Lazy Learning Appro... |
121
click to vote
CEC
2010
IEEE
14 years 12 months ago
2010
IEEE
The great majority of genetic programming (GP) algorithms that deal with the classification problem follow a supervised approach, i.e., they consider that all fitness cases availab...
105
click to vote
ACMSE
2006
ACM
15 years 8 months ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
122
click to vote
TSMC
2010
14 years 8 months ago
2010
Abstract--This paper presents a dynamic predictiveoptimization framework of a nonlinear temporal process. Datamining (DM) and evolutionary strategy algorithms are integrated in the...
ICML
2006
IEEE
16 years 2 months ago
2006
IEEE
We introduce relational temporal difference learning as an effective approach to solving multi-agent Markov decision problems with large state spaces. Our algorithm uses temporal ...
IJAIT
2007
15 years 1 months ago
2007
: This work presents an original algorithmic model of some essential features of psychogenetic theory, as was proposed by J.Piaget. Specifically, we modeled some elements of cognit...