Sciweavers

1101 search results - page 80 / 221
» heuristics 2007
Sort
View
CASCON
1992
134views Education» more  CASCON 1992»
13 years 11 months ago
Cluster busting in anchored graph drawing
Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layout. The challenging aspect of designing layout adjustment algorithms is to maint...
Kelly A. Lyons
CN
2007
87views more  CN 2007»
13 years 9 months ago
Routing and quality of service support for mobile ad hoc networks
OLSR is an optimization over classical link state protocols tailored for mobile ad hoc networks. In this paper, we propose the QOLSR protocol which includes quality parameters to ...
Anelise Munaretto, Mauro Fonseca
CCGRID
2007
IEEE
14 years 4 months ago
Query-load balancing in structured overlays
Query-load (forwarding and answering) balancing in structured overlays is one of the most critical and least studied problems. It has been assumed that caching heuristics can take...
Anwitaman Datta, Roman Schmidt, Karl Aberer
SIBGRAPI
2007
IEEE
14 years 4 months ago
Two-stage Binary Image Operator Design: an Approach Based on Interaction Information
We address the problem of binary image operator design over large windows by breaking it into two phases. Firstly, we design several operators over small sub-windows of the main w...
Carlos S. Santos, Nina S. T. Hirata, Roberto Hirat...
RTCSA
2007
IEEE
14 years 3 months ago
Code Size Optimization for Embedded Processors using Commutative Transformations
Code optimization of the offset assignment generated in embedded systems allows for power and space efficient systems. We propose a new heuristic that uses edge classification to ...
Sai Pinnepalli, Jinpyo Hong, J. Ramanujam, Doris L...