Sciweavers

13603 search results - page 2699 / 2721
» On the Complexity of Computing Treelength
Sort
View
DC
2010
13 years 9 months ago
Refined quorum systems
It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform f...
Rachid Guerraoui, Marko Vukolic
CSCW
2008
ACM
13 years 9 months ago
Context-linked virtual assistants for distributed teams: an astrophysics case study
There is a growing need for distributed teams to analyze complex and dynamic data streams and make critical decisions under time pressure. Via a case study, we discuss potential g...
Sarah S. Poon, Rollin C. Thomas, Cecilia R. Aragon...
EOR
2010
93views more  EOR 2010»
13 years 9 months ago
Two-stage flexible-choice problems under uncertainty
A significant input-data uncertainty is often present in practical situations. One approach to coping with this uncertainty is to describe the uncertainty with scenarios. A scenar...
Jurij Mihelic, Amine Mahjoub, Christophe Rapine, B...
AI
2006
Springer
13 years 9 months ago
Backward-chaining evolutionary algorithms
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...
Riccardo Poli, William B. Langdon
ALMOB
2006
113views more  ALMOB 2006»
13 years 9 months ago
Inverse bifurcation analysis: application to simple gene systems
Background: Bifurcation analysis has proven to be a powerful method for understanding the qualitative behavior of gene regulatory networks. In addition to the more traditional for...
James Lu, Heinz W. Engl, Peter Schuster
« Prev « First page 2699 / 2721 Last » Next »