Sciweavers

5634 search results - page 499 / 1127
» About Abstract Classes
Sort
View
168
Voted
CPC
2006
110views more  CPC 2006»
15 years 6 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Alexander D. Scott, Gregory B. Sorkin
FS
2006
65views more  FS 2006»
15 years 6 months ago
Consistency among trading desks
Abstract. We consider a bank having several trading desks, each of which trades a different class of contingent claims with each desk using a different model. We assume that the mo...
David Heath, Hyejin Ku
CORR
2007
Springer
194views Education» more  CORR 2007»
15 years 6 months ago
Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs
Abstract—This paper presents a systematic methodology to derive and classify fast algorithms for linear transforms. The approach is based on the algebraic signal processing theor...
Markus Püschel, José M. F. Moura
JGO
2008
98views more  JGO 2008»
15 years 6 months ago
Duality for almost convex optimization problems via the perturbation approach
Abstract. We deal with duality for almost convex finite dimensional optimization problems by means of the classical perturbation approach. To this aim some standard results from th...
Radu Ioan Bot, Gábor Kassay, Gert Wanka
193
Voted
JAIR
2006
118views more  JAIR 2006»
15 years 6 months ago
Negotiating Socially Optimal Allocations of Resources
A multiagent system may be thought of as an artificial society of autonomous software agents and we can apply concepts borrowed from welfare economics and social choice theory s t...
Ulrich Endriss, Nicolas Maudet, Fariba Sadri, Fran...