Sciweavers

5090 search results - page 148 / 1018
» Constructing Strategies for Programming
Sort
View
SIGECOM
2005
ACM
97views ECommerce» more  SIGECOM 2005»
14 years 2 months ago
Complexity of (iterated) dominance
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
Vincent Conitzer, Tuomas Sandholm
CIG
2006
IEEE
14 years 3 months ago
Evolving Adaptive Play for the Game of Spoof Using Genetic Programming
Abstract— Many games require opponent modelling for optimal performance. The implicit learning and adaptive nature of evolutionary computation techniques offer a natural way to d...
Mark Wittkamp, Luigi Barone
ICLP
1998
Springer
14 years 1 months ago
A Choice-Point Library for Backtrack Programming
Implementing a compiler for a language with nondeterministic features is known to be a difficult task. This paper presents two new functions setChoicePoint and fail that extend th...
Pierre-Etienne Moreau
ASPDAC
2004
ACM
74views Hardware» more  ASPDAC 2004»
14 years 1 months ago
Optimal design of high fan-in multiplexers via mixed-integer nonlinear programming
- In this paper, a novel strategy for designing the heterogeneous-tree multiplexer is proposed. We build the multiplexer delay model by curve fitting and then formulate the heterog...
Hsu-Wei Huang, Cheng-Yeh Wang, Jing-Yang Jou
ADG
2000
Springer
110views Mathematics» more  ADG 2000»
14 years 1 months ago
Decision Complexity in Dynamic Geometry
Abstract. Geometric straight-line programs [5, 8] can be used to model geometric constructions and their implicit ambiguities. In this paper we discuss the complexity of deciding w...
Ulrich Kortenkamp, Jürgen Richter-Gebert