Sciweavers

378 search results - page 5 / 76
» The Complexity of Models of International Trade
Sort
View
VISUALIZATION
1996
IEEE
14 years 21 days ago
Visualization of Complex Models Using Dynamic Texture-based Simplification
We are investigating methods for simplifying complex models for interactive visualizations using texture-based representations. This paper presents a simplification method which d...
Daniel G. Aliaga
SIGECOM
2004
ACM
254views ECommerce» more  SIGECOM 2004»
14 years 2 months ago
Competitive algorithms for VWAP and limit order trading
We introduce new online models for two important aspects of modern financial markets: Volume Weighted Average Price trading and limit order books. We provide an extensive study o...
Sham Kakade, Michael J. Kearns, Yishay Mansour, Lu...
AI
2005
Springer
13 years 8 months ago
The complexity of contract negotiation
The use of software agents for automatic contract negotiation in e-commerce and e-trading ents has been the subject of considerable recent interest. A widely studied abstract mode...
Paul E. Dunne, Michael Wooldridge, Michael Laurenc...
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
13 years 10 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 8 months ago
Reversal Complexity Revisited
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
André Hernich, Nicole Schweikardt