Sciweavers

1802 search results - page 45 / 361
» Complexity Theory for Operators in Analysis
Sort
View
170
Voted
SAS
1995
Springer
127views Formal Methods» more  SAS 1995»
15 years 8 months ago
Complementation in Abstract Interpretation
ntation in Abstract Interpretation AGOSTINO CORTESI Universit`a di Venezia GILBERTO FIL´E Universit`a di Padova ROBERTO GIACOBAZZI Universit`a di Pisa CATUSCIA PALAMIDESSI Univers...
Agostino Cortesi, Gilberto Filé, Roberto Gi...
KI
2009
Springer
15 years 11 months ago
Planning with h +  in Theory and Practice
Abstract. Many heuristic estimators for classical planning are based on the socalled delete relaxation, which ignores negative effects of planning operators. Ideally, such heuristi...
Christoph Betz, Malte Helmert
FUIN
2007
134views more  FUIN 2007»
15 years 4 months ago
Complexity Issues in Multiagent Logics
Abstract. Our previous research presents a methodology of cooperative problem solving for beliefdesire-intention (BDI) systems, based on a complete formal theory called TEAMLOG. Th...
Marcin Dziubinski, Rineke Verbrugge, Barbara Dunin...
SIGMETRICS
2005
ACM
120views Hardware» more  SIGMETRICS 2005»
15 years 10 months ago
Managing server energy and operational costs in hosting centers
The growing cost of tuning and managing computer systems is leading to out-sourcing of commercial services to hosting centers. These centers provision thousands of dense servers w...
Yiyu Chen, Amitayu Das, Wubi Qin, Anand Sivasubram...
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
15 years 11 months ago
Extended probe method for linkage discovery over high-cardinality alphabets
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
Shude Zhou, Zengqi Sun, Robert B. Heckendorn