Sciweavers

10055 search results - page 1749 / 2011
» Structured programming using processes
Sort
View
128
Voted
BMCBI
2010
156views more  BMCBI 2010»
15 years 2 months ago
Protein complex prediction via verifying and reconstructing the topology of domain-domain interactions
Background: High-throughput methods for detecting protein-protein interactions enable us to obtain large interaction networks, and also allow us to computationally identify the as...
Yosuke Ozawa, Rintaro Saito, Shigeo Fujimori, Hisa...
IIE
2007
114views more  IIE 2007»
15 years 2 months ago
Design and Implementation of a Logo-based Computer Graphics Course
Two years ago the Faculty of Mathematics and Informatics at Sofia University makes a decision to design a new series of Logo-based courses which make use of the modern technology....
Pavel Boytchev
TASE
2008
IEEE
15 years 2 months ago
Group Elevator Scheduling With Advance Information for Normal and Emergency Modes
Group elevator scheduling has long been recognized as an important problem for building transportation efficiency, since unsatisfactory elevator service is one of the major complai...
Peter B. Luh, Bo Xiong, Shi-Chung Chang
ANOR
2004
170views more  ANOR 2004»
15 years 2 months ago
Graph Coloring for Air Traffic Flow Management
The aim of Air Traffic Flow Management (ATFM) is to enhance the capacity of the airspace while satisfying Air Traffic Control constraints and airlines requests to optimize their o...
Nicolas Barnier, Pascal Brisset
CORR
2010
Springer
142views Education» more  CORR 2010»
15 years 27 days ago
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
Paolo Boldi, Marco Rosa, Sebastiano Vigna
« Prev « First page 1749 / 2011 Last » Next »