Sciweavers

893 search results - page 25 / 179
» P3C: A New Algorithm for the Simple Temporal Problem
Sort
View
AAAI
2007
13 years 10 months ago
A Connectionist Cognitive Model for Temporal Synchronisation and Learning
The importance of the efforts towards integrating the symbolic and connectionist paradigms of artificial intelligence has been widely recognised. Integration may lead to more e...
Luís C. Lamb, Rafael V. Borges, Artur S. d'...
ICDM
2005
IEEE
168views Data Mining» more  ICDM 2005»
14 years 1 months ago
Discovering Frequent Arrangements of Temporal Intervals
In this paper we study a new problem in temporal pattern mining: discovering frequent arrangements of temporal intervals. We assume that the database consists of sequences of even...
Panagiotis Papapetrou, George Kollios, Stan Sclaro...
RECOMB
2006
Springer
14 years 8 months ago
Simple and Fast Inverse Alignment
For as long as biologists have been computing alignments of sequences, the question of what values to use for scoring substitutions and gaps has persisted. While some choices for s...
John D. Kececioglu, Eagu Kim
AI
2000
Springer
13 years 7 months ago
Using temporal logics to express search control knowledge for planning
Over the years increasingly sophisticated planning algorithms have been developed. These have made for more efficient planners, but unfortunately these planners still suffer from ...
Fahiem Bacchus, Froduald Kabanza
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 8 months ago
The Santa Claus problem
The Santa Claus problem is an interesting exercise in concurrent programming which has been used in a comparison of the concurrency mechanisms of Ada and Java. We present a simple...
Nikhil Bansal, Maxim Sviridenko