Sciweavers

2086 search results - page 170 / 418
» Mathematical Theory Exploration
Sort
View
135
Voted
PODC
2009
ACM
16 years 4 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
121
Voted
PODC
2009
ACM
16 years 4 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher
145
Voted
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 4 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
133
Voted
CDC
2008
IEEE
186views Control Systems» more  CDC 2008»
15 years 10 months ago
Continuous-time behavioral portfolio selection
This paper formulates and studies a general continuous-time behavioral portfolio selection model under Kahneman and Tversky's (cumulative) prospect theory, featuring S-shaped...
Hanqing Jin, Xun Yu Zhou
STACS
1993
Springer
15 years 8 months ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob