Sciweavers

1298 search results - page 67 / 260
» The online set cover problem
Sort
View
ACSW
2004
15 years 7 months ago
Applying Online Gradient Descent Search to Genetic Programming for Object Recognition
This paper describes an approach to the use of gradient descent search in genetic programming (GP) for object classification problems. In this approach, pixel statistics are used ...
William D. Smart, Mengjie Zhang
HICSS
2002
IEEE
172views Biometrics» more  HICSS 2002»
15 years 11 months ago
Collaborative Software Development: A Discussion of Problem Solving Models and Groupware Technologies
Teamwork is always challenging. Adding the complication of problem solving and software design only amplifies this challenge. The challenges of developing software as a team can b...
Joanna DeFranco-Tommarello, Fadi P. Deek
EOR
2010
159views more  EOR 2010»
15 years 1 months ago
An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle routing problem. It arises when each vehicle performs several routes during the wor...
Nabila Azi, Michel Gendreau, Jean-Yves Potvin
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
15 years 11 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
MFCS
2009
Springer
16 years 28 days ago
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf ...