Sciweavers

971 search results - page 138 / 195
» Planning with Reduced Operator Sets
Sort
View
IJCAI
1993
14 years 11 months ago
Diagnosing and Solving Over-Determined Constraint Satisfaction Problems
Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...
R. R. Bakker, F. Dikker, F. Tempelman, P. M. Wognu...
AI
2006
Springer
14 years 10 months ago
Propagation algorithms for lexicographic ordering constraints
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian...
CN
2006
124views more  CN 2006»
14 years 10 months ago
Packet classification using diagonal-based tuple space search
Multidimensional packet classification has attracted considerable research interests in the past few years due to the increasing demand on policy based packet forwarding and secur...
Fu-Yuan Lee, Shiuh-Pyng Shieh
GIS
2006
ACM
14 years 10 months ago
B-Spline curve smoothing under position constraints for line generalisation
Currently, most of the operations performed for the construction of marine charts are still done manually. However, with the development of more and more powerful techniques, new ...
Eric Guilbert, Hui Lin 0002
SIGMETRICS
2008
ACM
111views Hardware» more  SIGMETRICS 2008»
14 years 10 months ago
Predicting the resource consumption of network intrusion detection systems
Abstract. When installing network intrusion detection systems (NIDSs), operators are faced with a large number of parameters and analysis options for tuning trade-offs between dete...
Holger Dreger, Anja Feldmann, Vern Paxson, Robin S...