Sciweavers

1941 search results - page 168 / 389
» On the Hardness of Approximate Reasoning
Sort
View
DOCENG
2007
ACM
15 years 10 months ago
XML version detection
The problem of version detection is critical in many important application scenarios, including software clone identification, Web page ranking, plagiarism detection, and peer-to-...
Deise de Brum Saccol, Nina Edelweiss, Renata de Ma...
AAAI
2007
15 years 8 months ago
Optimal Multi-Agent Scheduling with Constraint Programming
We consider the problem of computing optimal schedules in multi-agent systems. In these problems, actions of one agent can influence the actions of other agents, while the object...
Willem Jan van Hoeve, Carla P. Gomes, Bart Selman,...
AAAI
2008
15 years 8 months ago
AnalogySpace: Reducing the Dimensionality of Common Sense Knowledge
We are interested in the problem of reasoning over very large common sense knowledge bases. When such a knowledge base contains noisy and subjective data, it is important to have ...
Robert Speer, Catherine Havasi, Henry Lieberman
WSC
2008
15 years 8 months ago
Distributed simulation in industry - a survey Part 3 - the HLA standard in industry
Distributed simulation, more specifically the HLA standard, is hardly applied in industry. We have conducted an extensive survey with COTS (commercial off-the-shelf) simulation pa...
Csaba Attila Boer, Arie de Bruin, Alexander Verbra...
CONCUR
2005
Springer
15 years 8 months ago
The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation
Abstract. Delaying the synchronization of actions may reveal some hidden behavior that would not happen if the synchronization met the specified deadlines. This precise phenomenon...
Pedro R. D'Argenio, Biniam Gebremichael