Sciweavers

12194 search results - page 463 / 2439
» Numberings Optimal for Learning
Sort
View
SIGECOM
2005
ACM
120views ECommerce» more  SIGECOM 2005»
16 years 13 days ago
Optimal design of English auctions with discrete bid levels
In this paper we consider a common form of the English auction that is widely used in online Internet auctions. This discrete bid auction requires that the bidders may only submit...
Esther David, Alex Rogers, Jeremy Schiff, Sarit Kr...
DEXA
1995
Springer
126views Database» more  DEXA 1995»
15 years 10 months ago
A Heuristic Approach for Optimization of Path Expressions
Abstract. The object-oriented database management systems store references to objects (implicit joins, precomputed joins), and use path expressions in query languages. One way of e...
Cetin Ozkan, Asuman Dogac, Cem Evrendilek
MICRO
2000
IEEE
176views Hardware» more  MICRO 2000»
15 years 6 months ago
An Advanced Optimizer for the IA-64 Architecture
level of abstraction, compared with the program representation for scalar optimizations. For example, loop unrolling and loop unrolland-jam transformations exploit the large regist...
Rakesh Krishnaiyer, Dattatraya Kulkarni, Daniel M....
IJCAI
2007
15 years 8 months ago
Learning to Walk through Imitation
Programming a humanoid robot to walk is a challenging problem in robotics. Traditional approaches rely heavily on prior knowledge of the robot's physical parameters to devise...
Rawichote Chalodhorn, David B. Grimes, Keith Groch...
CGO
2003
IEEE
15 years 10 months ago
Optimal and Efficient Speculation-Based Partial Redundancy Elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
Qiong Cai, Jingling Xue