Sciweavers

741 search results - page 146 / 149
» Programming with Live Distributed Objects
Sort
View
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie
ENC
2005
IEEE
14 years 1 months ago
Hard Problem Generation for MKP
We developed generators that produce challenging MKP instances. Our approaches uses independently exponential distributions over a wide range to generate the constraint coefficien...
Maria A. Osorio, Germn Cuaya
WOWMOM
2005
ACM
109views Multimedia» more  WOWMOM 2005»
14 years 1 months ago
On Maximizing Lifetime of a Sensor Cluster
We consider the energy consumed in radio transmission of a set of sensors forming a data gathering wireless network. Our objective is to enhance the lifetime of such networks by e...
Samar Agnihotri, Pavan Nuggehalli, H. S. Jamadagni
COMPGEOM
2010
ACM
14 years 19 days ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
INFOCOM
2000
IEEE
13 years 12 months ago
Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...
Murali S. Kodialam, T. V. Lakshman