Sciweavers

6142 search results - page 460 / 1229
» The Complexity of Partition Functions
Sort
View
JPDC
2007
191views more  JPDC 2007»
15 years 6 months ago
Clustering wireless ad hoc networks with weakly connected dominating set
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
Bo Han, Weijia Jia
VC
2008
118views more  VC 2008»
15 years 6 months ago
Hierarchical part-type segmentation using voxel-based curve skeletons
Abstract We present an effective framework for segmenting 3D shapes into meaningful components using the curve skeleton. Our algorithm identifies a number of critical points on the...
Dennie Reniers, Alexandru Telea
KBS
2007
56views more  KBS 2007»
15 years 6 months ago
Domain-dependent distributed models for railway scheduling
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
Miguel A. Salido, Montserrat Abril, Federico Barbe...
ANOR
2002
128views more  ANOR 2002»
15 years 6 months ago
Crew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search
The Airline Crew Assignment Problem (ACA) consists of assigning lines of work to a set of crew members such that a set of activities is partitioned and the costs for that assignmen...
Meinolf Sellmann, Kyriakos Zervoudakis, Panagiotis...
CCE
2004
15 years 6 months ago
Module-oriented automatic differentiation in chemical process systems optimization
It is common that external procedures are incorporated into an equation-oriented model when modeling complex chemical process systems. The so-obtained models are called composite ...
Xiang Li, Zhijiang Shao, Jixin Qian