Sciweavers

388 search results - page 16 / 78
» A Mixed Closure-CSP Method to Solve Scheduling Problems
Sort
View
CSB
2005
IEEE
210views Bioinformatics» more  CSB 2005»
14 years 2 months ago
Problem Solving Environment Approach to Integrating Diverse Biological Data Sources
Scientists face an ever-increasing challenge in investigating biological systems with high throughput experimental methods such as mass spectrometry and gene arrays because of the...
Eric G. Stephan, Kyle R. Klicker, Mudita Singhal, ...
ISPD
1998
ACM
107views Hardware» more  ISPD 1998»
14 years 29 days ago
Sequence-pair based placement method for hard/soft/pre-placed modules
This paper proposes a placement method for a mixed set of hard, soft, and pre-placed modules, based on a placement topology representation called sequence-pair. Under one sequence...
Hiroshi Murata, Ernest S. Kuh
HEURISTICS
2010
13 years 3 months ago
An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport
Operation management of underground passenger transport systems is associated with combinatorial optimization problems (known as crew and train scheduling and rostering) which bel...
Rafael Elizondo, Víctor Parada, Lorena Prad...
HPCC
2007
Springer
14 years 18 days ago
A New Method for Multi-objective TDMA Scheduling in Wireless Sensor Networks Using Pareto-Based PSO and Fuzzy Comprehensive Judg
In wireless sensor networks with many-to-one transmission mode, a multi-objective TDMA (Time Division Multiple Access) scheduling model is presented, which concerns about the packe...
Tao Wang, Zhiming Wu, Jianlin Mao
TVCG
2011
120views more  TVCG 2011»
13 years 3 months ago
Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming
—Metro maps are schematic diagrams of public transport networks that serve as visual aids for route planning and navigation tasks. It is a challenging problem in network visualiz...
Martin Nöllenburg, Alexander Wolff