Sciweavers

1806 search results - page 32 / 362
» Some Functions Computable with a Fused-Mac
Sort
View
TON
2008
125views more  TON 2008»
13 years 11 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni

Publication
319views
12 years 9 months ago
 Viability Evolution: Elimination and Extinction in Evolutionary Computation
Current mainstream Evolutionary Algorithms (EA) are based on the concept of selection, encapsulated in the definition of a fitness function. Besides selection, however, the natur...
Claudio Mattiussi
CSREAPSC
2006
14 years 11 days ago
An Access Control Framework for Pervasive Computing Environments
Abstract. The explosive evolution of pervasive computing environments presents several new challenges such as smart spaces, invisibility, localized scalability, and masking uneven ...
Sarah Javanmardi, Hadi Hemmati, Rasool Jalili
VLDB
1998
ACM
105views Database» more  VLDB 1998»
14 years 3 months ago
Computing Iceberg Queries Efficiently
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg querie...
Min Fang, Narayanan Shivakumar, Hector Garcia-Moli...
ASC
2011
13 years 6 months ago
Quality of Service constrained routing optimization using Evolutionary Computation
In this work, a novel optimization framework is proposed that allows the improvement of Quality of Service levels in TCP/IP based networks, by configuring the routing weights of ...
Miguel Rocha, Pedro Sousa, Paulo Cortez, Miguel Ri...