Sciweavers

2957 search results - page 514 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
EOR
2010
107views more  EOR 2010»
13 years 7 months ago
An optimization-based heuristic for the robotic cell problem
This study investigates an optimization-based heuristic for the Robotic Cell Problem. This problem arises in automated cells and is a complex ow shop problem with a single transpo...
Jacques Carlier, Mohamed Haouari, Mohamed Kharbech...
ALIFE
2006
13 years 7 months ago
Axiomatic Scalable Neurocontroller Analysis via the Shapley Value
One of the major challenges in the field of neurally driven evolved autonomous agents is deciphering the neural mechanisms underlying their behavior. Aiming at this goal, we have d...
Alon Keinan, Ben Sandbank, Claus C. Hilgetag, Isaa...
EOR
2008
76views more  EOR 2008»
13 years 7 months ago
Rental price and rental duration under retail competition
Consider a retailer that rents products to customers for a pre-specified rental duration. By considering the dynamics of uncertain rental demand and return processes, we first pre...
Christopher S. Tang, Sarang Deo
COMCOM
2006
89views more  COMCOM 2006»
13 years 7 months ago
Quantifying the effects of recent protocol improvements to TCP: Impact on Web performance
We assess the state of Internet congestion control and error recovery through a controlled study that considers the integration of standards-track TCP error recovery and both TCP ...
Michele C. Weigle, Kevin Jeffay, F. Donelson Smith
GIS
2006
ACM
13 years 7 months ago
Qualitative polyline similarity testing with applications to query-by-sketch, indexing and classification
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...
Bart Kuijpers, Bart Moelans, Nico Van de Weghe