Sciweavers

9842 search results - page 249 / 1969
» Problem complexity
Sort
View
ICCS
2009
Springer
16 years 1 months ago
Towards a Complex Automata Multiscale Model of In-Stent Restenosis
Abstract. In-stent restenosis, the maladaptive response of a blood vessel to injury caused by the deployment of a stent, is a multiscale problem involving a large number of process...
Alfonso Caiazzo, David Evans, Jean-Luc Falcone, Ja...
ATAL
2006
Springer
15 years 10 months ago
Learning the required number of agents for complex tasks
Coordinating agents in a complex environment is a hard problem, but it can become even harder when certain characteristics of the tasks, like the required number of agents, are un...
Sébastien Paquet, Brahim Chaib-draa
CVPR
2012
IEEE
13 years 9 months ago
Learning latent temporal structure for complex event detection
In this paper, we tackle the problem of understanding the temporal structure of complex events in highly varying videos obtained from the Internet. Towards this goal, we utilize a...
Kevin Tang, Fei-Fei Li, Daphne Koller
TCS
2010
15 years 4 months ago
A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
Katerina Asdre, Stavros D. Nikolopoulos
ICLP
1997
Springer
15 years 10 months ago
The Complexity of Model Checking in Modal Event Calculi
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 propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...