Sciweavers

75 search results - page 11 / 15
» Termination Analysis of Higher-Order Functional Programs
Sort
View
ICFP
2005
ACM
14 years 1 months ago
Fast narrowing-driven partial evaluation for inductively sequential programs
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
DBPL
2007
Springer
103views Database» more  DBPL 2007»
13 years 11 months ago
Datalog Programs over Infinite Databases, Revisited
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
Sara Cohen, Joseph Gil, Evelina Zarivach
CEC
2011
IEEE
12 years 7 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
JGO
2010
100views more  JGO 2010»
13 years 2 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti
IFIP
2000
Springer
13 years 11 months ago
A Performance Analysis of IEEE 802.11 Networks in the Presence of Hidden Stations
: IEEE 802.11 is a wireless network standard that was completed in 1997. Unfortunately, the medium access protocol described in the standard meets some problems that arise from the...
Marek Natkaniec, Andrzej R. Pach