Sciweavers

529 search results - page 77 / 106
» Simple Random Logic Programs
Sort
View
FLOPS
2004
Springer
14 years 1 months ago
Analysing Definitional Trees: Looking for Determinism
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...
Pascual Julián Iranzo, Christian Villamizar...
ECAIW
1994
Springer
14 years 1 months ago
Representing and Executing Agent-Based Systems
Abstract. In this paper we describe an approach to the representation and implementation of agent-based systems where the behaviour of an individual agent is represented by a set o...
Michael Fisher
JLP
2007
159views more  JLP 2007»
13 years 9 months ago
Reasoning about interaction protocols for customizing web service selection and composition
This work faces the problem of web service selection and composition, discussing the advantages that derive from the inclusion, in a web service declarative description, of the hi...
Matteo Baldoni, Cristina Baroglio, Alberto Martell...
ICASSP
2011
IEEE
13 years 1 months ago
Optimum multi-user detection by nonsmooth optimization
—The optimum multiuser detection (OMD) is a discrete (binary) optimization. The previously developed approaches often relax it by a semi-definite program (SDP) and then employ r...
Hoang Duong Tuan, Tran Thai Son, Hoang Tuy, Ha H. ...
ESORICS
2012
Springer
12 years 8 days ago
Boosting the Permissiveness of Dynamic Information-Flow Tracking by Testing
Tracking information flow in dynamic languages remains an open challenge. It might seem natural to address the challenge by runtime monitoring. However, there are well-known funda...
Arnar Birgisson, Daniel Hedin, Andrei Sabelfeld