Sciweavers

150 search results - page 29 / 30
» Traversing a set of points with a minimum number of turns
Sort
View
CCA
2009
Springer
13 years 9 months ago
Effective Choice and Boundedness Principles in Computable Analysis
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
Vasco Brattka, Guido Gherardi
ESANN
2006
13 years 6 months ago
Dynamical reservoir properties as network effects
It has been proposed that chaos can serve as a reservoir providing an infinite number of dynamical states [1, 2, 3, 4, 5]. These can be interpreted as different behaviors, search a...
Carlos Lourenço
ICDE
2005
IEEE
120views Database» more  ICDE 2005»
14 years 6 months ago
Progressive Distributed Top k Retrieval in Peer-to-Peer Networks
Query processing in traditional information management systems has moved from an exact match model to more flexible paradigms allowing cooperative retrieval by aggregating the dat...
Wolf-Tilo Balke, Wolfgang Nejdl, Wolf Siberski, Uw...
GLOBECOM
2007
IEEE
13 years 11 months ago
Path Diversity in Packet Switched Networks: Performance Analysis and Rate Allocation
—Path diversity works by setting up multiple parallel connections between the end points using the topological path redundancy of the network. In this paper, Forward Error Correc...
Shervan Fashandi, Shahab Oveis Gharan, Amir K. Kha...
ALGORITHMICA
2011
12 years 8 months ago
Algorithms for Marketing-Mix Optimization
Algorithms for determining quality/cost/price tradeoffs in saturated markets are consid-3 ered. A product is modeled by d real-valued qualities whose sum determines the unit cost ...
Joachim Gudmundsson, Pat Morin, Michiel H. M. Smid