Sciweavers

1686 search results - page 110 / 338
» Programs as polygraphs: computability and complexity
Sort
View
EGH
2005
Springer
15 years 12 months ago
Optimal automatic multi-pass shader partitioning by dynamic programming
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...
Alan Heirich
GECCO
2004
Springer
169views Optimization» more  GECCO 2004»
15 years 11 months ago
Genetic Programming Neural Networks as a Bioinformatics Tool for Human Genetics
The identification of genes that influence the risk of common, complex diseases primarily through interactions with other genes and environmental factors remains a statistical and ...
Marylyn D. Ritchie, Christopher S. Coffey, Jason H...
AAAI
2000
15 years 7 months ago
The Game of Hex: An Automatic Theorem Proving Approach to Game Programming
The game of Hex is a two-player game with simple rules, a deep underlying mathematical beauty, and a strategic complexity comparable to that of Chess and Go. The massive game-tree...
Vadim V. Anshelevich
EOR
2007
68views more  EOR 2007»
15 years 6 months ago
Multiattribute electronic procurement using goal programming
One of the key challenges of current day electronic procurement systems is to enable procurement decisions transcend beyond a single attribute such as cost. Consequently, multiatt...
S. Kameshwaran, Y. Narahari, Charles H. Rosa, Deva...
BIRTHDAY
2003
Springer
15 years 11 months ago
Comet in Context
Combinatorial optimization problems naturally arise in many application areas, including logistics, manufacturing, supplychain management, and resource allocation. They often give...
Laurent Michel, Pascal Van Hentenryck