3690 search results - page 325 / 738 » Computation with classical sequents |
134
click to vote
KI
2009
Springer
16 years 4 days ago
2009
Springer
Abstract. Many heuristic estimators for classical planning are based on the socalled delete relaxation, which ignores negative effects of planning operators. Ideally, such heuristi...
155
click to vote
CCGRID
2008
IEEE
16 years 2 days ago
2008
IEEE
—Large scale production grids are a major case for autonomic computing. Following the classical definition of Kephart, an autonomic computing system should optimize its own beha...
143
click to vote
ICPR
2008
IEEE
16 years 1 days ago
2008
IEEE
An intrusion detection system (IDS) detects illegal manipulations of computer systems. In intrusion detection systems, feature reduction, including feature extraction and feature ...
131
click to vote
STACS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
152
click to vote
ICPPW
2006
IEEE
15 years 11 months ago
2006
IEEE
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...