Sciweavers

2957 search results - page 137 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
SIAMSC
2008
136views more  SIAMSC 2008»
15 years 4 months ago
On the Time Splitting Spectral Method for the Complex Ginzburg-Landau Equation in the Large Time and Space Scale Limit
We are interested in the numerical approximation of the complex Ginzburg
Pierre Degond, Shi Jin, Min Tang
ENTCS
2007
98views more  ENTCS 2007»
15 years 5 months ago
Evaluating Complex MAC Protocols for Sensor Networks with APMC
In this paper we present an analysis of a MAC (Medium Access Control) protocol for wireless sensor networks. The purpose of this protocol is to manage wireless media access by con...
Michaël Cadilhac, Thomas Hérault, Rich...
SOFSEM
2010
Springer
16 years 1 months ago
On the Complexity of the Highway Pricing Problem
Abstract. The highway pricing problem asks for prices to be determined for segments of a single highway such as to maximize the revenue obtainable from a given set of customers wit...
Alexander Grigoriev, Joyce van Loon, Marc Uetz
AAMAS
2012
Springer
14 years 23 days ago
Winner determination in voting trees with incomplete preferences and weighted votes
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
Jérôme Lang, Maria Silvia Pini, Franc...
140
Voted
ICALP
2005
Springer
15 years 10 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...