Sciweavers

11949 search results - page 303 / 2390
» Some results on (a:b)-choosability
Sort
View
CIKM
2009
Springer
15 years 6 months ago
Data extraction from the web using wild card queries
This paper presents an overview of our framework for searching and retrieving facts and relationships within natural language text sources. In this framework, an extraction task o...
Davood Rafiei, Haobin Li
CP
2001
Springer
15 years 6 months ago
New Lower Bounds of Constraint Violations for Over-Constrained Problems
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...
Jean-Charles Régin, Thierry Petit, Christia...
RTSS
1999
IEEE
15 years 6 months ago
Timing Anomalies in Dynamically Scheduled Microprocessors
Previous timing analysis methods have assumed that the worst-case instruction execution time necessarily corresponds to the worst-case behavior. We show that this assumption is wr...
Thomas Lundqvist, Per Stenström
ISCA
1998
IEEE
102views Hardware» more  ISCA 1998»
15 years 6 months ago
Dynamic History-length Fitting: A Third Level of Adaptivity for Branch Prediction
Accurate branch prediction is essential for obtaining high performance in pipelined superscalar processors that execute instructions speculatively. Some of the best current predic...
Toni Juan, Sanji Sanjeevan, Juan J. Navarro
EPS
1998
Springer
15 years 6 months ago
Complete Classes of Strategies for the Classical Iterated Prisoner's Dilemma
The Classical Iterated Prisoner's Dilemma (CIPD) is used to study the evolution of cooperation. We show, with a genetic approach, how basic ideas could be used in order to gen...
Bruno Beaufils, Jean-Paul Delahaye, Philippe Mathi...