Sciweavers

193 search results - page 25 / 39
» Several ways to solve the MSO problem
Sort
View
ICCBR
2007
Springer
15 years 3 months ago
Using Cases Utility for Heuristic Planning Improvement
Current efficient planners employ an informed search guided by a heuristic function that is quite expensive to compute. Thus, ordering nodes in the search tree becomes a key issue,...
Tomás de la Rosa, Angel García Olaya...
LPAR
2007
Springer
15 years 3 months ago
Deciding Knowledge in Security Protocols for Monoidal Equational Theories
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
Véronique Cortier, Stéphanie Delaune
SI3D
2006
ACM
15 years 3 months ago
Variance shadow maps
Shadow maps are a widely used shadowing technique in real time graphics. One major drawback of their use is that they cannot be filtered in the same way as color textures, typica...
William Donnelly, Andrew Lauritzen
DIALM
2003
ACM
99views Algorithms» more  DIALM 2003»
15 years 3 months ago
Spatio-temporal data reduction with deterministic error bounds
A common way of storing spatio-temporal information about mobile devices is in the form of a 3D (2D geography + time) trajectory. We argue that when cellular phones and Personal D...
Hu Cao, Ouri Wolfson, Goce Trajcevski
SC
2003
ACM
15 years 3 months ago
Job Superscheduler Architecture and Performance in Computational Grid Environments
Computational grids hold great promise in utilizing geographically separated heterogeneous resources to solve large-scale complex scientific problems. However, a number of major ...
Hongzhang Shan, Leonid Oliker, Rupak Biswas