Sciweavers

1816 search results - page 71 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
ESWA
2007
100views more  ESWA 2007»
15 years 5 months ago
Using memetic algorithms with guided local search to solve assembly sequence planning
The goal of assembly planning consists in generating feasible sequences to assemble a product and selecting an efficient assembly sequence from which related constraint factors su...
Hwai-En Tseng, Wen-Pai Wang, Hsun-Yi Shih
ICRA
2009
IEEE
164views Robotics» more  ICRA 2009»
16 years 18 days ago
Assigning cameras to subjects in video surveillance systems
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...
Hazem El-Alfy, David Jacobs, Larry Davis
EWCBR
2008
Springer
15 years 7 months ago
Instance-Based Label Ranking using the Mallows Model
In this paper, we introduce a new instance-based approach to the label ranking problem. This approach is based on a probability model on rankings which is known as the Mallows mode...
Weiwei Cheng, Eyke Hüllermeier
ECML
1991
Springer
15 years 9 months ago
A Multistrategy Learning Approach to Domain Modeling and Knowledge Acquisition
This paper presents an approach to domain modeling and knowledge acquisition that consists of a gradual and goal-driven improvement of an incomplete domain model provided by a hum...
Gheorghe Tecuci
AUSAI
2003
Springer
15 years 11 months ago
Dynamic Agent Ordering in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
Lingzhong Zhou, John Thornton, Abdul Sattar