Sciweavers

1686 search results - page 236 / 338
» Programs as polygraphs: computability and complexity
Sort
View
ICALP
2010
Springer
15 years 6 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
AAAI
1992
15 years 5 months ago
Automated Model Selection Using Context-Dependent Behaviors
Effective problem-solving about complex engineered devices requires device models that are both adequate for the problem and computationally efficient . Producing such models requ...
P. Pandurang Nayak, Leo Joskowicz, Sanjaya Addanki
LDTA
2010
15 years 4 months ago
Embedding a web-based workflow management system in a functional language
Workflow management systems guide and monitor tasks performed by humans and computers. The workflow specifications are usually expressed in special purpose (graphical) formalisms....
Jan Martin Jansen, Rinus Plasmeijer, Pieter W. M. ...
ENTCS
2006
155views more  ENTCS 2006»
15 years 4 months ago
Biomolecular Agents as Multi-behavioural Concurrent Objects
In recent years, there has been increasing interest in computational models of biological systems based on various calculi of communicating processes, such as the stochastic pi-ca...
Denys Duchier, Céline Kuttler
JMLR
2006
124views more  JMLR 2006»
15 years 3 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini