Sciweavers

1245 search results - page 205 / 249
» Topology generation based on network design heuristics
Sort
View
ACG
2009
Springer
16 years 22 days ago
Plans, Patterns, and Move Categories Guiding a Highly Selective Search
In this paper we present our ideas for an Arimaa-playing program (also called a bot) that uses plans and pattern matching to guide a highly selective search. We restrict move gener...
Gerhard Trippen
CGO
2010
IEEE
15 years 11 months ago
Taming hardware event samples for FDO compilation
Feedback-directed optimization (FDO) is effective in improving application runtime performance, but has not been widely adopted due to the tedious dual-compilation model, the difï...
Dehao Chen, Neil Vachharajani, Robert Hundt, Shih-...
LCTRTS
2010
Springer
15 years 8 months ago
An efficient code update scheme for DSP applications in mobile embedded systems
DSP processors usually provide dedicated address generation units (AGUs) to assist address computation. By carefully allocating variables in the memory, DSP compilers take advanta...
Weijia Li, Youtao Zhang
TSMC
1998
99views more  TSMC 1998»
15 years 5 months ago
Learning visually guided grasping: a test case in sensorimotor learning
Abstract—We present a general scheme for learning sensorimotor tasks which allows rapid on-line learning and generalization of the learned knowledge to unfamiliar objects. The sc...
Ishay Kamon, Tamar Flash, Shimon Edelman
ISSAC
1997
Springer
194views Mathematics» more  ISSAC 1997»
15 years 10 months ago
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
Qiang Li, Yike Guo, Tetsuo Ida, John Darlington