406 search results - page 60 / 82 » Kernelization and Complexity Results for Connectivity Augmen... |
115
click to vote
CI
2000
14 years 9 months ago
2000
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. W...
JGAA
2006
14 years 9 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
60
Voted
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
For Hidden Markov Models (HMMs) with fully connected transition models, the three fundamental problems of evaluating the likelihood of an observation sequence, estimating an optim...
155
click to vote
AGP
2010
IEEE
15 years 2 months ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...