Sciweavers

4565 search results - page 356 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
GLOBECOM
2010
IEEE
15 years 3 months ago
Graph-Based Optimization for Relay-Assisted Bidirectional Cellular Networks
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequency-division mult...
Yuan Liu, Meixia Tao
PPDP
2010
Springer
15 years 2 months ago
Tabling for transaction logic
Transaction Logic is a logic for representing declarative and procedural knowledge in logic programming, databases, and AI. It has been successful in areas as diverse as workflows...
Paul Fodor, Michael Kifer
306
Voted
GECCO
2011
Springer
374views Optimization» more  GECCO 2011»
14 years 8 months ago
A hybrid heuristic approach for solving the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
Petrica C. Pop, Serban Iordache
STOC
2001
ACM
111views Algorithms» more  STOC 2001»
16 years 5 months ago
Optimal outlier removal in high-dimensional
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
John Dunagan, Santosh Vempala
109
Voted
DATE
2005
IEEE
106views Hardware» more  DATE 2005»
15 years 10 months ago
SAT-Based Complete Don't-Care Computation for Network Optimization
This paper describes an improved approach to Boolean network optimization using internal don’t-cares. The improvements concern the type of don’t-cares computed, their scope, a...
Alan Mishchenko, Robert K. Brayton