Sciweavers

1455 search results - page 192 / 291
» Programming in Logic with Constraints for Natural Language P...
Sort
View
ICPR
2010
IEEE
14 years 10 months ago
A Probabilistic Language Model for Hand Drawings
Probabilistic language models are critical to applications in natural language processing that include speech recognition, optical character recognition, and interfaces for text e...
Abdullah Akce, Timothy Bretl
ICLP
2011
Springer
14 years 1 months ago
Transaction Logic with Defaults and Argumentation Theories
Transaction Logic is an extension of classical logic that gracefully integrates both declarative and procedural knowledge and has proved itself as a powerful formalism for many ad...
Paul Fodor, Michael Kifer
FSTTCS
2010
Springer
14 years 7 months ago
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
Matthew Hague, Anthony Widjaja To
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
15 years 4 months ago
Characterizing the genetic programming environment for fifth (GPE5) on a high performance computing cluster
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
Kenneth Holladay
ASPLOS
2011
ACM
14 years 1 months ago
Specifying and checking semantic atomicity for multithreaded programs
In practice, it is quite difficult to write correct multithreaded programs due to the potential for unintended and nondeterministic interference between parallel threads. A funda...
Jacob Burnim, George C. Necula, Koushik Sen