Sciweavers

1816 search results - page 114 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
151
Voted
ICRA
2008
IEEE
114views Robotics» more  ICRA 2008»
16 years 16 days ago
Mobile robot control in the road sign problem using Reservoir Computing networks
— In this work we tackle the road sign problem with Reservoir Computing (RC) networks. The T-maze task (a particular form of the road sign problem) consists of a robot in a T-sha...
Eric A. Antonelo, Benjamin Schrauwen, Dirk Strooba...
IPPS
1998
IEEE
15 years 10 months ago
A Comparative Study of Five Parallel Genetic Algorithms Using the Traveling Salesman Problem
Parallel genetic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial genetic algorithms (SGAs). They have also been used to s...
Lee Wang, Anthony A. Maciejewski, Howard Jay Siege...
235
Voted
DLOG
2011
14 years 9 months ago
On the Problem of Weighted Max-DL-SAT and its Application to Image Labeling
Abstract. For a number of problems, such as ontology learning or image labeling, we need to handle uncertainty and inconsistencies in an appropriate way. Fuzzy and Probabilistic De...
Stefan Scheglmann, Carsten Saathoff, Steffen Staab
183
Voted
PRICAI
1998
Springer
15 years 10 months ago
Dynamic Constraint Weighting for Over-Constrained Problems
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
John Thornton, Abdul Sattar
IJCAI
1989
15 years 7 months ago
A Planning/Scheduling Methodology for the Constrained Resource Problem
This paper presents a new planning/scheduling methodology for the constrained resource problem (CRP), in which the amount of available resources is limited and usually monotonical...
Naiping Keng, David Y. Y. Yun