Sciweavers

580 search results - page 68 / 116
» Approximation Algorithms for Temporal Reasoning
Sort
View
ICLP
2010
Springer
15 years 6 months ago
A Logical Paradigm for Systems Biology (Invited Talk)
[6]. An SBML model can be interpreted in Biocham at three abstraction levels: • the Boolean semantics (asynchronuous Boolean state transitions on the presence/absence of molecule...
François Fages
113
Voted
CGF
2010
155views more  CGF 2010»
15 years 2 months ago
Video Visualization for Snooker Skill Training
We present a feasibility study on using video visualization to aid snooker skill training. By involving the coaches and players in the loop of intelligent reasoning, our approach ...
M. Höferlin, Edward Grundy, Rita Borgo, Danie...
112
Voted
GIS
2010
ACM
15 years 1 months ago
Constrained free space diagrams: a tool for trajectory analysis
We propose a new and powerful tool for the analysis of trajectories, which in particular allows for more temporally aware analyses. Time plays an important role in the analysis of ...
Kevin Buchin, Maike Buchin, Joachim Gudmundsson
LICS
2010
IEEE
15 years 28 days ago
Alternating Timed Automata over Bounded Time
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
Mark Jenkins, Joël Ouaknine, Alexander Rabino...
ESA
2007
Springer
122views Algorithms» more  ESA 2007»
15 years 6 months ago
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...
Cristina Bazgan, Hadrien Hugot, Daniel Vanderpoote...