Sciweavers

618 search results - page 102 / 124
» Computational Models of Natural Language Argument
Sort
View
ASMTA
2011
Springer
295views Mathematics» more  ASMTA 2011»
13 years 1 days ago
Performance Evaluation of a Single Node with General Arrivals and Service
Queueing delays experienced by packets buffered at a node are among the most difficult to predict when considering the performance of a flow in a network. The arrivals of packets a...
Alexandre Brandwajn, Thomas Begin
ICALP
2007
Springer
14 years 2 months ago
Co-Logic Programming: Extending Logic Programming with Coinduction
In this paper we present the theory and practice of co-logic programming (co-LP for brevity), a paradigm that combines both inductive and coinductive logic programming. Co-LP is a ...
Luke Simon, Ajay Bansal, Ajay Mallya, Gopal Gupta
ASIAN
2003
Springer
111views Algorithms» more  ASIAN 2003»
14 years 1 months ago
Unreliable Failure Detectors via Operational Semantics
Abstract. The concept of unreliable failure detectors for reliable distributed systems was introduced by Chandra and Toueg as a fine-grained means to add weak forms of synchrony i...
Uwe Nestmann, Rachele Fuzzati
IV
2003
IEEE
200views Visualization» more  IV 2003»
14 years 1 months ago
Artist As Researcher, Understanding The Tools
The paper begins with a response to the nature of contemporary artists relationships to how computers have permeated the fine art domain and how they affect the creative process. ...
Theresa Gartland-Jones
CIDM
2007
IEEE
14 years 13 days ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...