Sciweavers

1569 search results - page 116 / 314
» Programming contest strategy
Sort
View
BIRTHDAY
2005
Springer
15 years 6 months ago
Planning in Answer Set Programming using Ordered Task Decomposition
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Jürgen Dix, Ugur Kuter, Dana S. Nau
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
15 years 7 months ago
Soft memory for stock market analysis using linear and developmental genetic programming
Recently, a form of memory usage was introduced for genetic programming (GP) called “soft memory.” Rather than have a new value completely overwrite the old value in a registe...
Garnett Carl Wilson, Wolfgang Banzhaf
99
Voted
ICLP
2005
Springer
15 years 6 months ago
A Generic Framework for the Analysis and Specialization of Logic Programs
The relationship between abstract interpretation and partial deduction has received considerable attention and (partial) integrations have been proposed starting from both the part...
Germán Puebla, Elvira Albert, Manuel V. Her...
97
Voted
INFOCOM
2010
IEEE
14 years 11 months ago
Analyzing Nonblocking Switching Networks using Linear Programming (Duality)
Abstract—The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to determine the minimum number of some switching compo...
Hung Q. Ngo, Atri Rudra, Anh N. Le, Thanh-Nhan Ngu...
100
Voted
ACMSE
2009
ACM
15 years 7 months ago
A case for compiler-driven superpage allocation
Most modern microprocessor-based systems provide support for superpages both at the hardware and software level. Judicious use of superpages can significantly cut down the number...
Joshua Magee, Apan Qasem