Sciweavers

972 search results - page 175 / 195
» Using Preference Order in Ontologies
Sort
View
CIKM
1994
Springer
13 years 11 months ago
Analytical Version Control Management in a Hypertext System
may be saved for later reuse of material, but also to preserve the historical perspective of work done [ha:92]. In particular, in distributed and collaborative hypertext systems, v...
Antonina Dattolo, Antonio Gisolfi
AIPS
2004
13 years 9 months ago
A Lookahead Strategy for Heuristic Search Planning
The planning as heuristic search framework, initiated by the planners ASP from Bonet, Loerincs and Geffner, and HSP from Bonet and Geffner, lead to some of the most performant pla...
Vincent Vidal
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
13 years 5 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
IJVR
2006
124views more  IJVR 2006»
13 years 7 months ago
Improving Virtual Reality Applications in CAD through Semantics
In this article we propose an architecture for the inclusion and exploitation of semantic aspects in a CAD environment. Our schema focuses on the enhancement and improvement of a c...
Carlos Toro, Jorge Posada, Stefan Wundrak, Andr&ea...
ICPP
1998
IEEE
13 years 12 months ago
Routing Algorithms for Anycast Messages
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
Dong Xuan, Weijia Jia, Wei Zhao