Sciweavers

244 search results - page 5 / 49
» Generalized RANSAC Framework for Relaxed Correspondence Prob...
Sort
View
COR
2007
183views more  COR 2007»
13 years 7 months ago
Arcs-states models for the vehicle routing problem with time windows and related problems
This paper presents several Arcs-States models that can be applied to numerous vehicle routing problems, one of which is the well-known vehicle routing problem with capacities and...
Thierry Mautor, Edith Naudin
KCAP
2005
ACM
14 years 1 months ago
Relaxed Precision and Recall for Ontology Matching
In order to evaluate the performance of ontology matching algorithms it is necessary to confront them with test ontologies and to compare the results. The most prominent criteria ...
Marc Ehrig, Jérôme Euzenat
AAAI
2010
13 years 9 months ago
A General Framework for Representing and Reasoning with Annotated Semantic Web Data
We describe a generic framework for representing and reasoning with annotated Semantic Web data, formalise the annotated language, the corresponding deductive system, and address ...
Umberto Straccia, Nuno Lopes 0002, Gergely Lukacsy...
INFOCOM
2008
IEEE
14 years 1 months ago
Index Policies for Real-Time Multicast Scheduling for Wireless Broadcast Systems
Abstract—Motivated by the increasing usage of wireless broadcast networks for multicast real-time applications like video, this paper considers a canonical real-time multicast sc...
Vivek Raghunathan, Vivek S. Borkar, Min Cao, P. R....
ICRA
1998
IEEE
142views Robotics» more  ICRA 1998»
13 years 11 months ago
Lagrangian Relaxation Neural Networks for Job Shop Scheduling
Abstract--Manufacturing scheduling is an important but difficult task. In order to effectively solve such combinatorial optimization problems, this paper presents a novel Lagrangia...
Peter B. Luh, Xing Zhao, Yajun Wang