Sciweavers

1477 search results - page 196 / 296
» Random Convex Programs
Sort
View
INFOCOM
2000
IEEE
14 years 1 months ago
Heuristics for Internet Map Discovery
— Mercator is a program that uses hop-limited probes—the same primitive used in traceroute—to infer an Internet map. It uses informed random address probing to carefully expl...
Ramesh Govindan, Hongsuda Tangmunarunkit
IVEVA
2004
13 years 10 months ago
Groups and Crowds with behaviors specified in the environment
Abstract. In this paper we describe a system where behavior of characters and groups of characters are determined by assigning attributes to groups and individuals hierarchically a...
Isaac Rudomín, Fernando Perez, Erik Mill&aa...
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 9 months ago
"Real" Slepian-Wolf Codes
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field ac...
Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg
IPL
2007
94views more  IPL 2007»
13 years 9 months ago
The finite horizon investor problem with a budget constraint
We study a model that incorporates a budget constraint in a decision making problem. Our goal is to maximize the expected wealth, where in each time period we can either stop the ...
Asaf Levin
COR
2004
127views more  COR 2004»
13 years 8 months ago
Towards the real time solution of strike force asset allocation problems
The strike force asset allocation problem consists of grouping strike force assets into packages and assigning these packages to targets and defensive assets in a way that maximiz...
Vincent Chi-Wei Li, Guy L. Curry, E. Andrew Boyd