Sciweavers

672 search results - page 86 / 135
» On the Expressive Power of the Loop Language
Sort
View
ICLP
1997
Springer
15 years 10 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
15 years 7 months ago
Genetic programming with polymorphic types and higher-order functions
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
Franck Binard, Amy P. Felty
APAL
2005
125views more  APAL 2005»
15 years 6 months ago
Dynamic topological logic
Dynamic Topological Logic provides a context for studying the confluence of the topological semantics for S4, based on topological spaces rather than Kripke frames; topological dy...
Philip Kremer, Grigori Mints
OOPSLA
2010
Springer
15 years 4 months ago
The two-state solution: native and serializable continuations accord
Continuation-based Web servers provide advantages over traditional Web application development through the increase of expressive power they allow. This leads to fewer errors and ...
Jay A. McCarthy
JMLR
2012
13 years 8 months ago
Learning Low-order Models for Enforcing High-order Statistics
Models such as pairwise conditional random fields (CRFs) are extremely popular in computer vision and various other machine learning disciplines. However, they have limited expre...
Patrick Pletscher, Pushmeet Kohli