1420 search results - page 58 / 284 » Multi-point Constructive Search |
122
click to vote
MICAI
2004
Springer
15 years 9 months ago
2004
Springer
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
128
click to vote
GECCO
2010
Springer
15 years 5 months ago
2010
Springer
Several population-based methods (with origins in the world of evolutionary strategies and estimation-of-distribution algorithms) for black-box optimization in continuous domains ...
146
click to vote
PKC
2010
Springer
15 years 5 months ago
2010
Springer
This paper presents an efficient protocol for securely computing the fundamental problem of pattern matching. This problem is defined in the two-party setting, where party P1 hold...
131
click to vote
IJCAI
2001
15 years 5 months ago
2001
As AI systems make their way into the mainstream of interactive applications, usability becomes an increasingly important factor in their success. A wide range of user interface d...
119
click to vote
SIAMDM
2008
15 years 3 months ago
2008
Given a partition of the vertices of a graph into two sets, a flip is a move of a vertex from its own set to the other, under the condition that it has more incident edges to vert...