Sciweavers

295 search results - page 31 / 59
» A New Node Centroid Algorithm for Bandwidth Minimization
Sort
View
71
Voted
BMCBI
2010
143views more  BMCBI 2010»
14 years 10 months ago
An efficient biological pathway layout algorithm combining grid-layout and spring embedder for complicated cellular location inf
Background: Graph drawing is one of the important techniques for understanding biological regulations in a cell or among cells at the pathway level. Among many available layout al...
Kaname Kojima, Masao Nagasaki, Satoru Miyano
115
Voted
IS
2006
14 years 10 months ago
Processing approximate aggregate queries in wireless sensor networks
In-network data aggregation has been recently proposed as an effective means to reduce the number of messages exchanged in wireless sensor networks. Nodes of the network form an a...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
ANOR
2008
171views more  ANOR 2008»
14 years 10 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
89
Voted
ICCCN
2007
IEEE
15 years 4 months ago
On Improving the Precision of Localization with Minimum Resource Allocation
— Autonomous localization of nodes in wireless sensor networks is essential to minimize the complex self organization task and consequently enhancing the overall network lifetime...
Frank Reichenbach, Dirk Timmermann
ICNP
2005
IEEE
15 years 3 months ago
Shape Shifting Tries for Faster IP Route Lookup
Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2]. Unfortunately, the time required by these algorithm...
Haoyu Song, Jonathan S. Turner, John W. Lockwood