3250 search results - page 351 / 650 » An Algorithm to Solve a Linear Program |
168
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. Multi-FPGA systems (MFS) are used for a great variety of applications, for instance, dynamically re-configurable hardware applications, digital circuit emulation, and num...
165
click to vote
PPCP
1993
15 years 10 months ago
1993
Use of constraint-based techniques in interactive graphics applications poses a variety of unique challenges to system implementors. This paper begins by describing how interface ...
142
click to vote
DAM
2007
15 years 6 months ago
2007
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem ...
161
click to vote
AI
1999
Springer
15 years 6 months ago
1999
Springer
There are many different approaches to solving planning problems, one of which is the use of domain specific control knowledge to help guide a domain independent search algorithm. ...
163
click to vote
COCO
2005
Springer
16 years 6 days ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...