Sciweavers

11949 search results - page 40 / 2390
» Some results on (a:b)-choosability
Sort
View
112
Voted
BCS
2008
15 years 2 months ago
Compiling C-like Languages to FPGA Hardware: Some Novel Approaches Targeting Data Memory Organisation
This paper describes our approaches to raise the level of abstraction at which hardware suitable for accelerating computationally-intensive applications can be specified. Field-Pr...
Qiang Liu, George A. Constantinides, Konstantinos ...
108
Voted
AIPS
2004
15 years 2 months ago
An Empirical Analysis of Some Heuristic Features for Local Search in LPG
LPG is a planner that performed very well in the last International planning competition (2002). The system is based on a stochastic local search procedure, and it incorporates se...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina
SLP
1989
87views more  SLP 1989»
15 years 1 months ago
Partial Evaluation in Prolog: Some Improvements about Cut
Two main aspects of Partial Evaluation for Prolog programs are considered: treatment of cuts and control of recursion. The analysis about cut is exhaustive: we consider occurrence...
Michele Bugliesi, F. Russo
97
Voted
DM
2008
78views more  DM 2008»
15 years 23 days ago
Planarization and fragmentability of some classes of graphs
The coefficient of fragmentability of a class of graphs measures the proportion of vertices that need to be removed from the graphs in the class in order to leave behind bounded s...
Keith Edwards, Graham Farr
75
Voted
APAL
2006
63views more  APAL 2006»
15 years 22 days ago
Satisfaction of existential theories in finitely presented groups and some embedding theorems
Abstract. The main result is that for every recursively enumerable existential consistent theory (in the usual language of group theory), there exists a finitely presented SQ-univ...
Abderezak Ould Houcine