Sciweavers

2842 search results - page 313 / 569
» Expansion and Search in Networks
Sort
View
NETWORKS
2010
15 years 5 months ago
A branch-and-cut algorithm for partition coloring
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...
DCOSS
2009
Springer
16 years 1 months ago
Optimal Allocation of Time-Resources for Multihypothesis Activity-Level Detection
Abstract. The optimal allocation of samples for activity-level detection in a wireless body area network for health-monitoring applications is considered. A wireless body area netw...
Gautam Thatte, Viktor Rozgic, Ming Li, Sabyasachi ...
ACMSE
2009
ACM
16 years 1 months ago
Bit vector algorithms enabling high-speed and memory-efficient firewall blacklisting
In a world of increasing Internet connectivity coupled with increasing computer security risks, security conscious network applications implementing blacklisting technology are be...
J. Lane Thames, Randal Abler, David Keeling
GECCO
2007
Springer
182views Optimization» more  GECCO 2007»
16 years 28 days ago
An analysis of the effects of population structure on scalable multiobjective optimization problems
Multiobjective evolutionary algorithms (MOEA) are an effective tool for solving search and optimization problems containing several incommensurable and possibly conflicting objec...
Michael Kirley, Robert L. Stewart
GIR
2006
ACM
16 years 22 days ago
Range-capable Distributed Hash Tables
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
Alessandro Soro, Cristian Lai