Sciweavers

3663 search results - page 139 / 733
» Problems in the ontology of computer programs
Sort
View
ASP
2001
Springer
15 years 2 months ago
Answer Set Programming and Bounded Model Checking
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. This is an extension of earlier w...
Keijo Heljanko, Ilkka Niemelä
TOMS
1998
148views more  TOMS 1998»
14 years 9 months ago
PELLPACK: A Problem-Solving Environment for PDE-Based Applications on Multicomputer Platforms
This paper presents the software architecture and implementation of the problem solving environment (PSE) PELLPACK for modeling physical objects described by partial differential ...
Elias N. Houstis, John R. Rice, Sanjiva Weerawaran...
JSW
2006
98views more  JSW 2006»
14 years 10 months ago
A Jxta Based Asynchronous Peer-to-Peer Implementation of Genetic Programming
Abstract-- Solving complex real-world problems using evolutionary computation is a CPU time-consuming task that requires a large amount of computational resources. Peerto-Peer (P2P...
Gianluigi Folino, Agostino Forestiero, Giandomenic...
JMLR
2010
115views more  JMLR 2010»
14 years 8 months ago
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwr...
COR
2007
106views more  COR 2007»
14 years 9 months ago
On a stochastic sequencing and scheduling problem
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
Antonio Alonso-Ayuso, Laureano F. Escudero, M. Ter...