Sciweavers

4539 search results - page 639 / 908
» Approaches to Compute Workflow Complexity
Sort
View
CORR
2004
Springer
119views Education» more  CORR 2004»
15 years 6 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
JCSS
2000
116views more  JCSS 2000»
15 years 6 months ago
Time-Space Tradeoffs for Satisfiability
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
Lance Fortnow
DCG
1998
53views more  DCG 1998»
15 years 6 months ago
Motion Planning in Environments with Low Obstacle Density
We present a simple and e cient paradigm for computing the exact solution of the motionplanning problem in environments with a low obstacle density. Such environments frequently o...
A. Frank van der Stappen, Mark H. Overmars, Mark d...
RE
2002
Springer
15 years 6 months ago
Relating Software Requirements and Architectures Using Problem Frames
Problem frames provide a means of analyzing and decomposing problems. They emphasise the world outside of the computer, helping the developer to focus on the problem domain, inste...
Jon G. Hall, Michael Jackson, Robin C. Laney, Bash...
MIS
2007
Springer
159views Multimedia» more  MIS 2007»
15 years 6 months ago
The application of fluid mobility modelling in wireless cellular networks
Mobility models, synthetic or trace, try to accurately model the movement of a single user or a group of users. Models are used in simulators and emulators to investigate the cons...
Ronan J. Skehill, Sean McGrath