Sciweavers

1795 search results - page 293 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
AAAI
2007
14 years 8 days ago
Near-optimal Observation Selection using Submodular Functions
AI problems such as autonomous robotic exploration, automatic diagnosis and activity recognition have in common the need for choosing among a set of informative but possibly expen...
Andreas Krause, Carlos Guestrin
ATAL
2008
Springer
13 years 12 months ago
A multi-agent simulation system for prediction and scheduling of aero engine overhaul
The Aero Repair and Overhaul industry is facing an increasing challenge of prediction and scheduling of engine overhauls to remain competitive in a complex business arena. An appr...
Armin Stranjak, Partha Sarathi Dutta, Mark Ebden, ...
CCS
2008
ACM
13 years 12 months ago
Towards experimental evaluation of code obfuscation techniques
While many obfuscation schemes proposed, none of them satisfy any strong definition of obfuscation. Furthermore secure generalpurpose obfuscation algorithms have been proven to be...
Mariano Ceccato, Massimiliano Di Penta, Jasvir Nag...
CIKM
2008
Springer
13 years 12 months ago
Rewriting of visibly pushdown languages for xml data integration
In this paper, we focus on XML data integration by studying rewritings of XML target schemas in terms of source schemas. Rewriting is very important in data integration systems wh...
Alex Thomo, Srinivasan Venkatesh
COMPGEOM
2008
ACM
13 years 11 months ago
Circular partitions with applications to visualization and embeddings
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
Krzysztof Onak, Anastasios Sidiropoulos