Sciweavers

1391 search results - page 134 / 279
» Complexity Limitations on Quantum Computation
Sort
View
AAAI
1994
13 years 9 months ago
Small is Beautiful: A Brute-Force Approach to Learning First-Order Formulas
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
Steven Minton, Ian Underwood
COR
2008
116views more  COR 2008»
13 years 8 months ago
Robust multiperiod portfolio management in the presence of transaction costs
We study the viability of different robust optimization approaches to multiperiod portfolio selection. Robust optimization models treat future asset returns as uncertain coefficie...
Dimitris Bertsimas, Dessislava Pachamanova
TCSV
2008
152views more  TCSV 2008»
13 years 8 months ago
Animation Key-Frame Extraction and Simplification Using Deformation Analysis
Three-dimensional animating meshes have been widely used in the computer graphics and video game industries. Reducing the animating mesh complexity is a common way of overcoming th...
Tong-Yee Lee, Chao-Hung Lin, Yu-Shuen Wang, Tai-Gu...
ISI
2007
Springer
13 years 8 months ago
Outil autonome de surveillance de grilles
ABSTRACT. Grids have become very complex. It makes the deployment and maintenance of systems a difficult task requiring lots of efforts from administrators. We believe that peer-t...
Laurent Baduel, Satoshi Matsuoka
TVCG
2008
109views more  TVCG 2008»
13 years 7 months ago
Rapid Graph Layout Using Space Filling Curves
Abstract-- Network data frequently arises in a wide variety of fields, and node-link diagrams are a very natural and intuitive representation of such data. In order for a node-link...
Chris Muelder, Kwan-Liu Ma