Sciweavers

315 search results - page 44 / 63
» Eigenvalue bounds for independent sets
Sort
View
ICDCSW
2005
IEEE
14 years 3 months ago
Cluster-Based Intelligent Searching in Unstructured Peer-to-Peer Networks
Existing cluster-based searching schemes in unstructured peer-to-peer (P2P) networks employ flooding/random forwarding on connected dominating sets (CDS) of networks. There exist...
Xiuqi Li, Jie Wu
CDC
2009
IEEE
117views Control Systems» more  CDC 2009»
14 years 2 months ago
Information dissemination in networks via linear iterative strategies over finite fields
— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
Shreyas Sundaram, Christoforos N. Hadjicostis
ASPDAC
1998
ACM
119views Hardware» more  ASPDAC 1998»
14 years 2 months ago
Integer Programming Models for Optimization Problems in Test Generation
— Test Pattern Generation for combinational circuits entails the identification of primary input assignments for detecting each fault in a set of target faults. An extension to ...
João P. Marques Silva
SODA
2007
ACM
99views Algorithms» more  SODA 2007»
13 years 11 months ago
Matroids, secretary problems, and online mechanisms
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
Moshe Babaioff, Nicole Immorlica, Robert Kleinberg
FLAIRS
2004
13 years 11 months ago
A Local Search/Constraint Propagation Hybrid for a Network Routing Problem
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
Jonathan Lever