Sciweavers

1816 search results - page 96 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
EVOW
2004
Springer
15 years 11 months ago
A Hierarchical Social Metaheuristic for the Max-Cut Problem
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
Abraham Duarte, Felipe Fernández, Án...
IOR
2006
173views more  IOR 2006»
15 years 6 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau
CPAIOR
2009
Springer
16 years 18 days ago
Solution Enumeration for Projected Boolean Search Problems
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
Martin Gebser, Benjamin Kaufmann, Torsten Schaub
ICCV
1998
IEEE
16 years 8 months ago
Minimizing Algebraic Error in Geometric Estimation Problems
This paper gives a widely applicable technique for solving many of the parameter estimation problems encountered in geometric computer vision. A commonly used approach is to minim...
Richard I. Hartley
IPPS
2006
IEEE
16 years 2 days ago
Coordinate transformation - a solution for the privacy problem of location based services?
Protecting location information of mobile users in Location Based Services (LBS) is a very important but quite difficult and still largely unsolved problem. Location information h...
Andreas Gutscher