Sciweavers

367 search results - page 39 / 74
» Multi-Core Design Automation Challenges
Sort
View
IDEAS
2002
IEEE
135views Database» more  IDEAS 2002»
14 years 17 days ago
On Implicate Discovery and Query Optimization
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
Kristofer Vorwerk, G. N. Paulley
ECAI
2008
Springer
13 years 9 months ago
Justification-Based Non-Clausal Local Search for SAT
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
Matti Järvisalo, Tommi A. Junttila, Ilkka Nie...
SERVICES
2008
51views more  SERVICES 2008»
13 years 9 months ago
Iterative Workflows for Numerical Simulations in Subsurface Sciences
Numerical simulators are frequently used to assess future risks, support remediation and monitoring program decisions, and assist in design of specific remedial actions with respe...
Jared Chase, Karen Schuchardt, George Chin Jr., Je...
WEBNET
2000
13 years 9 months ago
Developing Web Browser Recording Tools Using Server-Side Programming Technology
: It is always a challenge to present Web applications at a facility with no Internet connection. Traditional presentation methods such as transparencies or slides are inadequate f...
Chris J. Lu, Anantha Bangalore, Tony Tse
JAIR
2006
122views more  JAIR 2006»
13 years 7 months ago
Solving Factored MDPs with Hybrid State and Action Variables
Efficient representations and solutions for large decision problems with continuous and discrete variables are among the most important challenges faced by the designers of automa...
Branislav Kveton, Milos Hauskrecht, Carlos Guestri...