Sciweavers

999 search results - page 84 / 200
» Constraints in Non-Boolean Contexts
Sort
View
CONSTRAINTS
2006
99views more  CONSTRAINTS 2006»
15 years 6 months ago
An Integrated Method for Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker
ICCV
2005
IEEE
16 years 8 months ago
Evaluation of Features Detectors and Descriptors Based on 3D Objects
We explore the performance of a number of popular feature detectors and descriptors in matching 3D object features across viewpoints and lighting conditions. To this end we design...
Pierre Moreels, Pietro Perona
PPSN
2004
Springer
15 years 11 months ago
Dynamic Routing Problems with Fruitful Regions: Models and Evolutionary Computation
Abstract. We introduce the concept of fruitful regions in a dynamic routing context: regions that have a high potential of generating loads to be transported. The objective is to m...
Jano I. van Hemert, Johannes A. La Poutré
IEEEARES
2010
IEEE
15 years 11 months ago
Architecture-Aware Adaptive Deployment of Contextual Security Policies
—Deploying a security policy may prove difficult whenever the system does not embed all necessary security functionalities. Some specific functionalities are required to accura...
Stere Preda, Nora Cuppens-Boulahia, Fréd&ea...
UM
2009
Springer
15 years 11 months ago
History Dependent Recommender Systems Based on Partial Matching
Abstract. This paper focuses on the utilization of the history of navigation within recommender systems. It aims at designing a collaborative recommender based on Markov models rel...
Armelle Brun, Geoffray Bonnin, Anne Boyer