Sciweavers

424 search results - page 74 / 85
» Realizability models and implicit complexity
Sort
View
JCC
1998
71views more  JCC 1998»
13 years 8 months ago
Docking small ligands in flexible binding sites
: A novel procedure for docking ligands in a flexible binding site is presented. It relies on conjugate gradient minimization, during which nonbonded interactions are gradually swi...
Joannis Apostolakis, Andreas Plückthun, Amede...
NIPS
2004
13 years 10 months ago
Multiple Alignment of Continuous Time Series
Multiple realizations of continuous-valued time series from a stochastic process often contain systematic variations in rate and amplitude. To leverage the information contained i...
Jennifer Listgarten, Radford M. Neal, Sam T. Rowei...
ALGOSENSORS
2007
Springer
14 years 2 months ago
Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
Anirvan DuttaGupta, Arijit Bishnu, Indranil Sengup...
EDBTW
2004
Springer
14 years 2 months ago
Index-Based Keyword Search in Mediator Systems
Many users and applications require the integration of semi-structured data from autonomous, heterogeneous Web sources. Over the last years mediator systems have emerged that use d...
Ingolf Geist
ER
2006
Springer
169views Database» more  ER 2006»
13 years 10 months ago
A More Expressive Softgoal Conceptualization for Quality Requirements Analysis
Initial software quality requirements tend to be imprecise, subjective, idealistic, and context-specific. An extended characterization of the common Softgoal concept is proposed fo...
Ivan Jureta, Stéphane Faulkner, Pierre-Yves...