Sciweavers

8825 search results - page 1518 / 1765
» All for one or one for all
Sort
View
CSMR
2007
IEEE
15 years 1 months ago
A Case Study of Defect-Density and Change-Density and their Progress over Time
We have performed an empirical case study, investigating defect-density and change-density of a reusable framework compared with one application reusing it over time at a large Oi...
Anita Gupta, Odd Petter N. Slyngstad, Reidar Conra...
AI
2008
Springer
15 years 1 months ago
Speculative plan execution for information gathering
The execution performance of an information gathering plan can suffer significantly due to remote I/O latencies. A streaming dataflow model of execution addresses the problem to s...
Greg Barish, Craig A. Knoblock
ALGORITHMICA
2010
152views more  ALGORITHMICA 2010»
15 years 1 months ago
Gaming Prediction Markets: Equilibrium Strategies with a Market Maker
We study the equilibrium behavior of informed traders interacting with market scoring rule (MSR) market makers. One attractive feature of MSR is that it is myopically incentive com...
Yiling Chen, Stanko Dimitrov, Rahul Sami, Daniel M...
ALMOB
2007
129views more  ALMOB 2007»
15 years 1 months ago
Consistency of the Neighbor-Net Algorithm
Background: Neighbor-Net is a novel method for phylogenetic analysis that is currently being widely used in areas such as virology, bacteriology, and plant evolution. Given an inp...
David Bryant, Vincent Moulton, Andreas Spillner
AOR
2007
107views more  AOR 2007»
15 years 1 months ago
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
Juraj Hromkovic, Tobias Mömke, Kathleen Stein...
« Prev « First page 1518 / 1765 Last » Next »