Sciweavers

6004 search results - page 614 / 1201
» Parallelizing query optimization
Sort
View
189
Voted
DC
2010
15 years 6 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer
CAGD
2002
102views more  CAGD 2002»
15 years 6 months ago
Optimal slicing of free-form surfaces
Many applications, such as contour machining, rapid prototyping, and reverse engineering by laser scanner or coordinate measuring machine, involve sampling of free-from surfaces a...
Tait S. Smith, Rida T. Farouki, Mohammad al-Kandar...
TEC
2002
128views more  TEC 2002»
15 years 5 months ago
A framework for evolutionary optimization with approximate fitness functions
It is not unusual that an approximate model is needed for fitness evaluation in evolutionary computation. In this case, the convergence properties of the evolutionary algorithm are...
Yaochu Jin, Markus Olhofer, Bernhard Sendhoff
DEDS
2010
157views more  DEDS 2010»
15 years 3 months ago
On-line Optimal Control of a Class of Discrete Event Systems with Real-Time Constraints
We consider Discrete Event Systems (DES) involving tasks with real-time constraints and seek to control processing times so as to minimize a cost function subject to each task mee...
Jianfeng Mao, Christos G. Cassandras
TCS
2010
15 years 29 days ago
An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
Samuel Alexandre Vidal