Sciweavers

1382 search results - page 142 / 277
» Procedural Generation of Roads
Sort
View
ICML
2005
IEEE
16 years 7 months ago
Predicting relative performance of classifiers from samples
This paper is concerned with the problem of predicting relative performance of classification algorithms. It focusses on methods that use results on small samples and discusses th...
Rui Leite, Pavel Brazdil
CADE
2009
Springer
16 years 7 months ago
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
Stephan Falke, Deepak Kapur
VLSID
2002
IEEE
130views VLSI» more  VLSID 2002»
16 years 6 months ago
Using Randomized Rounding to Satisfy Timing Constraints of Real-Time Preemptive Tasks
In preemptive real-time systems, a tighter estimate of the Worst Case Response Time(WCRT) of the tasks can be obtained if the layout of the tasks in memory is included in the esti...
Anupam Datta, Sidharth Choudhury, Anupam Basu
VLSID
2002
IEEE
97views VLSI» more  VLSID 2002»
16 years 6 months ago
Multiple Faults: Modeling, Simulation and Test
We give an algorithm to model any given multiple stuck-at fault as a single stuck-at fault. The procedure requires insertion of at most ? ? ? modeling gates, when the multiplicity...
Yong Chang Kim, Vishwani D. Agrawal, Kewal K. Salu...
VLSID
2002
IEEE
83views VLSI» more  VLSID 2002»
16 years 6 months ago
Identifying Redundant Wire Replacements for Synthesis and Verification
We propose the redundancy identification of wire replacement faults. The solutions rely on the satisfiability (SAT) formulation of redundancy identification, augmented with the me...
Katarzyna Radecka, Zeljko Zilic