Sciweavers

1806 search results - page 228 / 362
» Randomness and halting probabilities
Sort
View
JIRS
2007
108views more  JIRS 2007»
15 years 4 months ago
GODZILA: A Low-resource Algorithm for Path Planning in Unknown Environments
— In this paper, we propose a novel path-planning and obstacle avoidance algorithm GODZILA for navigation in unknown environments. No prior knowledge of the environment is requir...
Prashanth Krishnamurthy, Farshad Khorrami
CN
2000
80views more  CN 2000»
15 years 4 months ago
An entropy approach to unintrusive targeted advertising on the Web
This paper describes the formulation of a new model for unintrusive targeted advertising on the web, extending the linear programming approach taken by Langheinrich et al.[10] A f...
John A. Tomlin
CORR
2000
Springer
95views Education» more  CORR 2000»
15 years 4 months ago
Effect of different packet sizes on RED performance
We consider the adaptation of random early detection (RED) as an active queue management algorithm for TCP traffic in Internet gateways where different maximum transfer units (MTU...
Stefaan De Cnodder, Omar Elloumi, Kenny Pauwels
CORR
2000
Springer
134views Education» more  CORR 2000»
15 years 4 months ago
Learning Complexity Dimensions for a Continuous-Time Control System
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...
Pirkko Kuusela, Daniel Ocone, Eduardo D. Sontag
DCG
2000
76views more  DCG 2000»
15 years 4 months ago
A Central Limit Theorem for Convex Chains in the Square
Points P1, . . . , Pn in the unit square define a convex n-chain if they are below y = x and, together with P0 = (0, 0) and Pn+1 = (1, 1), they are in convex position. Under unifo...
Imre Bárány, Günter Rote, Willi...