Sciweavers

4171 search results - page 812 / 835
» Choice numbers of graphs
Sort
View
SAC
2003
ACM
15 years 3 months ago
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
Günther R. Raidl, Bryant A. Julstrom
SMA
2003
ACM
169views Solid Modeling» more  SMA 2003»
15 years 3 months ago
Surface reconstruction of freeform objects based on multiresolution volumetric method
3D scanners developed over the past several decades have facilitated the reconstruction of complicated engineering parts. Typically the boundary representation of a part is recons...
Sergei Azernikov, Alex Miropolsky, Anath Fischer
ATAL
2003
Springer
15 years 3 months ago
Resource-aware exploration of the emergent dynamics of simulated systems
The emerging science of simulation enables us to explore the dynamics of large and complex systems even if a formal representation and analysis of the system is intractable and a ...
Sven Brueckner, H. Van Dyke Parunak
CAISE
2003
Springer
15 years 3 months ago
Hybrid Publish-Subscribe: A Compromise Approach for Large-Scale
Abstract. The purpose of this article is to propose a scalable, topologically and traffic-wise self-adapting approach to a publish/subscribe paradigm for supporting event-based app...
Roman Szarowski
CP
2003
Springer
15 years 3 months ago
Incremental Computation of Resource-Envelopes in Producer-Consumer Models
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
T. K. Satish Kumar