Sciweavers

4940 search results - page 191 / 988
» On the Complexity of Universal Programs
Sort
View
DAM
1999
132views more  DAM 1999»
15 years 5 months ago
Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
Giovanni Righini, Marco Trubian
ACL
2012
13 years 8 months ago
Text Segmentation by Language Using Minimum Description Length
The problem addressed in this paper is to segment a given multilingual document into segments for each language and then identify the language of each segment. The problem was mot...
Hiroshi Yamaguchi, Kumiko Tanaka-Ishii
ISMIS
2005
Springer
15 years 11 months ago
Flexible Pattern Discovery with (Extended) Disjunctive Logic Programming
Abstract. The post-genomic era showed up a wide range of new challenging issues for the areas of knowledge discovery and intelligent information management. Among them, the discove...
Luigi Palopoli, Simona E. Rombo, Giorgio Terracina
ECOOP
1995
Springer
15 years 9 months ago
Meta-level Programming with CodA
Abstract. Meta-levels are complex pieces of software with diverse demands in both the computation and interaction domains. Common techniques using just code to express behaviour fa...
Jeff McAffer
CLIMA
2004
15 years 7 months ago
Planning Experiments in the DALI Logic Programming Language
We discuss some features of the new logic programming language DALI for agents and multi-agent systems. In particular, we aim at illustrating the treatment of proactivity, which is...
Stefania Costantini, Arianna Tocchio