1529 search results - page 247 / 306 » Search Space Analysis of the Linear Ordering Problem |
VLDB
1993
ACM
14 years 28 days ago
1993
ACM
Although scientific data analysis increasingly requires accessandmanipulation of large quantitiesof data,current databasetechnology fails to meet the needsof scientific processing...
IJCAI
2003
13 years 10 months ago
2003
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
QEST
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--Model checkers for concurrent probabilistic systems have become very popular within the last decade. The study of long-run average behavior has however received only scan...
ESTIMEDIA
2009
Springer
13 years 6 months ago
2009
Springer
Abstract--Memory accesses are a major cause of energy consumption for embedded systems and the stack is a frequent target for data accesses. This paper presents a fully software te...
APPROX
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....