Sciweavers

471 search results - page 17 / 95
» Single-peaked consistency and its complexity
Sort
View
ICECCS
2010
IEEE
162views Hardware» more  ICECCS 2010»
13 years 7 months ago
Trust-Based Adaptation in Complex Service-Oriented Systems
Abstract—Complex networks consisting of humans and software services, such as Web-based social and collaborative environments, typically require flexible and context-based inter...
Florian Skopik, Daniel Schall, Schahram Dustdar
BMCBI
2010
102views more  BMCBI 2010»
13 years 7 months ago
SAMPLEX: Automatic mapping of perturbed and unperturbed regions of proteins and complexes
Background: The activity of proteins within the cell is characterized by their motions, flexibility, interactions or even the particularly intriguing case of partially unfolded st...
Mickaël Krzeminski, Karine Loth, Rolf Boelens...
CAD
2005
Springer
13 years 7 months ago
Optimizing the topological and combinatorial complexity of isosurfaces
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
Carlos Andújar, Pere Brunet, Antoni Chica, ...
CONCURRENCY
2002
116views more  CONCURRENCY 2002»
13 years 7 months ago
Parallel implementation of the fluid particle model for simulating complex fluids in the mesoscale
Dissipative particle dynamics (DPD) and its generalization - fluid particle model (FPM) - represent the "fluid particle" approach for simulating fluid-like behavior in t...
Krzysztof Boryczko, Witold Dzwinel, David A. Yuen
WIA
2004
Springer
14 years 27 days ago
Brute Force Determinization of NFAs by Means of State Covers
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
Jean-Marc Champarnaud, Fabien Coulon, Thomas Paran...