381 search results - page 41 / 77 » Time Complexity of genetic algorithms on exponentially scale... |
SIGIR
2005
ACM
14 years 1 months ago
2005
ACM
Previous research into the efficiency of text retrieval systems has dealt primarily with methods that consider inverted lists in sequence; these methods are known as term-at-a-tim...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recent advances in higher dimensions have led to new method...
IRI
2007
IEEE
14 years 2 months ago
2007
IEEE
Suppose we are given a set A of activities of interest, a set O of observations, and a probability threshold p. We are interested in finding the set of all pairs (a, O ), where a...
HPDC
2007
IEEE
14 years 2 months ago
2007
IEEE
Utility functions can be used to represent the value users attach to job completion as a function of turnaround time. Most previous scheduling research used simple synthetic repre...
DLOG
2007
13 years 10 months ago
2007
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...