Sciweavers

782 search results - page 89 / 157
» Can a Parser be Generated from Examples
Sort
View
FASE
2011
Springer
14 years 7 months ago
Automated Learning of Probabilistic Assumptions for Compositional Reasoning
Probabilistic verification techniques have been applied to the formal modelling and analysis of a wide range of systems, from communication protocols such as Bluetooth, to nanosca...
Lu Feng, Marta Z. Kwiatkowska, David Parker
298
Voted
GRAPHICSINTERFACE
2011
14 years 7 months ago
Formation sketching: an approach to stylize groups in crowd simulation
Most of existing crowd simulation algorithms focus on the moving trajectories of individual agents, while collective group formations are often roughly learned from video examples...
Qin Gu, Zhigang Deng
SAINT
2006
IEEE
15 years 10 months ago
Fair Overload Handling Using Proof-of-Work Functions
Overload can reduce the overall performance of a computer system up to a point where the whole service might collapse. Thus, for example the load on a server must be controlled to...
Sebastian Golze, Gero Mühl
NCA
2002
IEEE
15 years 3 months ago
The Construction of Smooth Models using Irregular Embeddings Determined by a Gamma Test Analysis
One of the key problems in forming a smooth model from input-output data is the determination of which input variables are relevant in predicting a given output. In this paper we ...
Alban P. M. Tsui, Antonia J. Jones, A. Guedes de O...
BMCBI
2006
118views more  BMCBI 2006»
15 years 3 months ago
Exploration of biological network centralities with CentiBiN
Background: The elucidation of whole-cell regulatory, metabolic, interaction and other biological networks generates the need for a meaningful ranking of network elements. Central...
Björn H. Junker, Dirk Koschützki, Falk S...