Sciweavers

363 search results - page 45 / 73
» Finding Small Solutions to Small Degree Polynomials
Sort
View
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
13 years 9 months ago
On the approximability of influence in social networks
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
Ning Chen
JPDC
2008
110views more  JPDC 2008»
13 years 7 months ago
Parallel multilevel algorithms for hypergraph partitioning
In this paper, we present parallel multilevel algorithms for the hypergraph partitioning problem. In particular, we describe schemes for parallel coarsening, parallel greedy k-way...
Aleksandar Trifunovic, William J. Knottenbelt
ANTSW
2010
Springer
13 years 5 months ago
Positional Communication and Private Information in Honeybee Foraging Models
Honeybees coordinate foraging efforts across vast areas through a complex system of advertising and recruitment. One mechanism for coordination is the waggle dance, a movement patt...
Peter Bailis, Radhika Nagpal, Justin Werfel
EVOW
2009
Springer
13 years 5 months ago
The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
Philipp Rohlfshagen, Xin Yao
JOCN
2011
90views more  JOCN 2011»
13 years 2 months ago
Medial Prefrontal Cortex Predicts Intertemporal Choice
■ People often make shortsighted decisions to receive small benefits in the present rather than large benefits in the future, that is, to favor their current selves over their f...
Jason P. Mitchell, Jessica Schirmer, Daniel L. Ame...