Sciweavers

305 search results - page 40 / 61
» Preference and Non-deterministic Choice
Sort
View
JACM
2006
112views more  JACM 2006»
14 years 9 months ago
Linear work suffix array construction
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
Juha Kärkkäinen, Peter Sanders, Stefan B...
MANSCI
2006
63views more  MANSCI 2006»
14 years 9 months ago
Multiplicative Background Risk
Although there has been much attention in recent years on the effects of additive background risks, the same is not true for its multiplicative counterpart. We consider random wea...
Günter Franke, Harris Schlesinger, Richard C....
SIAMSC
2008
111views more  SIAMSC 2008»
14 years 9 months ago
An Algebraic Multigrid Approach Based on a Compatible Gauge Reformulation of Maxwell's Equations
With the rise in popularity of compatible finite element, finite difference and finite volume discretizations for the time domain eddy current equations, there has been a correspon...
Pavel B. Bochev, Jonathan J. Hu, Christopher M. Si...
CG
2010
Springer
14 years 7 months ago
Rook Jumping Maze Design Considerations
We define the Rook Jumping Maze, provide historical perspective, and describe a generation method for such mazes. When applying stochastic local search algorithms to maze design, m...
Todd W. Neller, Adrian Fisher, Munyaradzi T. Choga...
70
Voted
AAAI
2012
13 years 14 hour ago
Evaluating Resistance to False-Name Manipulations in Elections
In many mechanisms (especially online mechanisms), a strategic agent can influence the outcome by creating multiple false identities. We consider voting settings where the mechan...
Bo Waggoner, Lirong Xia, Vincent Conitzer