1405 search results - page 234 / 281 » Popularity at Minimum Cost |
106
click to vote
ICCAD
1997
IEEE
15 years 1 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
EVOW
1994
Springer
15 years 1 months ago
1994
Springer
One of the main problems in applying evolutionary optimisation methods is the choice of operators and parameter values. This paper propose a competitive evolution method, in which ...
AAAI
2008
15 years 11 hour ago
2008
This paper considers the problem of an agent searching for a resource or a tangible good in a physical environment, where at each stage of its search it observes one source where ...
SIROCCO
2007
14 years 11 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
100
click to vote
WWW
2008
ACM
14 years 9 months ago
2008
ACM
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...