Sciweavers

8196 search results - page 199 / 1640
» Computational Modeling and Complexity Science
Sort
View
WG
2004
Springer
15 years 11 months ago
Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...
Zhi-Zhong Chen, Tatsuie Tsukiji
AO
2007
80views more  AO 2007»
15 years 6 months ago
Problems in the ontology of computer programs
As a first step in the larger project of charting the ontology of computer programs, we pose three central questions: (1) Can programs, hardware, and metaprograms be organized into...
Amnon H. Eden, Raymond Turner
CAD
2000
Springer
15 years 6 months ago
Efficiently computing and updating triangle strips for real-time rendering
Triangle strips are a widely used hardware-supported data-structure to compactly represent and efficiently render polygonal meshes. In this paper we survey the efficient generatio...
Jihad El-Sana, Francine Evans, Aravind Kalaiah, Am...
WSC
2007
15 years 8 months ago
A co-design modeling approach for computer network systems
Co-design modeling is considered key toward handling the complexity and scale of network systems. The ability to separately specify the software and hardware aspects of computer n...
Weilong Hu, Hessam S. Sarjoughian
GRID
2006
Springer
15 years 6 months ago
Simultaneous Scheduling of Replication and Computation for Data-Intensive Applications on the Grid
One of the first motivations of using grids comes from applications managing large data sets in field such as high energy physics or life sciences. To improve the global throughput...
Frederic Desprez, Antoine Vernois