4110 search results - page 319 / 822 » Efficient algorithms for the 2-gathering problem |
175
click to vote
FOCS
1992
IEEE
15 years 10 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
184
click to vote
ICGI
2010
Springer
15 years 4 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 ...
201
click to vote
WWW
2003
ACM
16 years 7 months ago
2003
ACM
Crawling the web is deceptively simple: the basic algorithm is (a) Fetch a page (b) Parse it to extract all linked URLs (c) For all the URLs not seen before, repeat (a)?(c). Howev...
177
click to vote
AGP
2003
IEEE
15 years 10 months ago
2003
IEEE
Abstract. The interest in the area of non-monotonic reasoning and declarative logic programming is growing rapidly after the recent development of a number of Answer Set Programmin...
189
click to vote
TVLSI
2010
15 years 1 months ago
2010
Abstract--Higher circuit densities in system-on-chip (SOC) designs have led to drastic increase in test data volume. Larger test data size demands not only higher memory requiremen...