Sciweavers

186 search results - page 31 / 38
» Exceptional planar polynomials
Sort
View
JCSS
2010
112views more  JCSS 2010»
13 years 6 months ago
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
Nadja Betzler, Britta Dorn
CP
2011
Springer
12 years 7 months ago
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Mako...
SMA
2005
ACM
131views Solid Modeling» more  SMA 2005»
14 years 1 months ago
Manifold splines
Constructing splines whose parametric domain is an arbitrary manifold and effectively computing such splines in realworld applications are of fundamental importance in solid and ...
Xianfeng Gu, Ying He 0001, Hong Qin
CORR
2010
Springer
155views Education» more  CORR 2010»
13 years 2 months ago
A Complexity View of Markets with Social Influence
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...
Xi Chen, Shang-Hua Teng
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
14 years 8 months ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri