1887 search results - page 235 / 378 » An efficient search algorithm for partially ordered sets |
123
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
143
click to vote
ICWN
2008
15 years 4 months ago
2008
: Problem statement: For a sensor network comprising autonomous and self-organizing data sources, efficient similarity-based search for semantic-rich resources (such as video data)...
168
click to vote
FOGA
2011
14 years 6 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
126
click to vote
ICGI
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
138
click to vote
ESWA
2010
15 years 15 days ago
2010
The Cell Formation Problem is a crucial component of a cell production design in a manufacturing system. This problem consists of a set of product parts to be manufactured in a gr...