Sciweavers

3475 search results - page 648 / 695
» Backbones in Optimization and Approximation
Sort
View
SIAMJO
2002
92views more  SIAMJO 2002»
13 years 10 months ago
Generalized Bundle Methods
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
Antonio Frangioni
SCHOLARPEDIA
2008
92views more  SCHOLARPEDIA 2008»
13 years 10 months ago
Computational models of classical conditioning
: We describe computer simulation of a number of associative models of classical conditioning in an attempt to assess the strengths and weaknesses of each model. The behavior of th...
Nestor A. Schmajuk
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 9 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
ALGOSENSORS
2009
Springer
13 years 8 months ago
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 5 months ago
New Results on the Capacity of the Gaussian Cognitive Interference Channel
The capacity of the two-user Gaussian cognitive interference channel, a variation of the classical interference channel where one of the transmitters has knowledge of both messages...
Stefano Rini, Daniela Tuninetti, Natasha Devroye