Sciweavers

8496 search results - page 249 / 1700
» Problem Solving and Complex Systems
Sort
View
104
Voted
GECCO
2006
Springer
184views Optimization» more  GECCO 2006»
15 years 6 months ago
Genetic algorithms and mixed integer linear programs for optimal strategies in a student's "sports" activity
This paper uses an entertaining student "sports" game to illustrate that GAs can be adapted to problems with uncertain properties and complexity. These problems can be s...
Thomas Butter, Franz Rothlauf, Jörn Grahl, To...
129
Voted
MP
2008
117views more  MP 2008»
15 years 2 months ago
Stochastic programming approach to optimization under uncertainty
In this paper we discuss computational complexity and risk averse approaches to two and multistage stochastic programming problems. We argue that two stage (say linear) stochastic ...
Alexander Shapiro
103
Voted
ISSS
1997
IEEE
109views Hardware» more  ISSS 1997»
15 years 6 months ago
Reducing the Complexity of ILP Formulations for Synthesis
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases. There exists some tools that give an o...
Anne Mignotte, Olivier Peyran
118
Voted
SAC
2009
ACM
15 years 9 months ago
On the practical importance of communication complexity for secure multi-party computation protocols
Many advancements in the area of Secure Multi-Party Computation (SMC) protocols use improvements in communication complexity as a justification. We conducted an experimental stud...
Florian Kerschbaum, Daniel Dahlmeier, Axel Schr&ou...
98
Voted
IANDC
2010
67views more  IANDC 2010»
15 years 1 months ago
Parameterized computational complexity of Dodgson and Young elections
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
Nadja Betzler, Jiong Guo, Rolf Niedermeier