Sciweavers

2766 search results - page 321 / 554
» Algorithms for trigonometric polynomials
Sort
View
ALDT
2009
Springer
186views Algorithms» more  ALDT 2009»
15 years 11 months ago
The Complexity of Probabilistic Lobbying
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
Gábor Erdélyi, Henning Fernau, Judy ...
WIA
2009
Springer
15 years 11 months ago
Implementation of State Elimination Using Heuristics
Abstract. State elimination is an intuitive and easy-to-implement algorithm that computes a regular expression from a finite-state automaton (FA). The size of a regular expression...
Jae-Hee Ahn, Yo-Sub Han
CPAIOR
2009
Springer
15 years 11 months ago
Solution Enumeration for Projected Boolean Search Problems
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
Martin Gebser, Benjamin Kaufmann, Torsten Schaub
ESA
2009
Springer
130views Algorithms» more  ESA 2009»
15 years 11 months ago
On the Performance of Approximate Equilibria in Congestion Games
We study the performance of approximate Nash equilibria for congestion games with polynomial latency functions. We consider how much the price of anarchy worsens and how much the ...
George Christodoulou, Elias Koutsoupias, Paul G. S...
CDC
2008
IEEE
115views Control Systems» more  CDC 2008»
15 years 11 months ago
Optimal sensor activation in controlled discrete event systems
— The problem of sensor activation in a controlled discrete event system is considered. Sensors are assumed to be costly and can be turned on/off during the operation of the syst...
Weilin Wang, Stéphane Lafortune, Feng Lin