Sciweavers

986 search results - page 99 / 198
» Generalized Goal Programming: polynomial methods and applica...
Sort
View
CP
2005
Springer
14 years 2 months ago
Using SAT in QBF
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
Horst Samulowitz, Fahiem Bacchus
AIPS
2007
13 years 11 months ago
Approximate Solution Techniques for Factored First-Order MDPs
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
Scott Sanner, Craig Boutilier
TDSC
2008
152views more  TDSC 2008»
13 years 9 months ago
Towards Formal Verification of Role-Based Access Control Policies
Specifying and managing access control policies is a challenging problem. We propose to develop formal verification techniques for access control policies to improve the current s...
Somesh Jha, Ninghui Li, Mahesh V. Tripunitara, Qih...
ICSE
2007
IEEE-ACM
14 years 9 months ago
Software Development Environments for Scientific and Engineering Software: A Series of Case Studies
The need for high performance computing applications for computational science and engineering projects is growing rapidly, yet there have been few detailed studies of the softwar...
Jeffrey C. Carver, Richard P. Kendall, Susan E. Sq...
OOPSLA
2004
Springer
14 years 2 months ago
Modeling event driven applications with a specification language (MEDASL)
Radio Frequency Identification (RFID) technology provides the means to track any object, any time, anywhere with Electronic Product Codes (EPC). A major consequence of this techno...
Murali Kaundinya, Ali Syed