Sciweavers

1569 search results - page 61 / 314
» Programming contest strategy
Sort
View
JUCS
2007
80views more  JUCS 2007»
13 years 9 months ago
Higher-Order Lazy Functional Slicing
: Program slicing is a well known family of techniques intended to identify and isolate code fragments which depend on, or are depended upon, specific program entities. This is pa...
Nuno F. Rodrigues, Luís Soares Barbosa
IPL
2007
71views more  IPL 2007»
13 years 10 months ago
A short proof of optimality for the MIN cache replacement algorithm
The MIN algorithm is an offline strategy for deciding which item to replace when writing a new item to a cache. Its optimality was first established by Mattson, Gecsei, Slutz, a...
Benjamin Van Roy
ISPD
2012
ACM
288views Hardware» more  ISPD 2012»
12 years 5 months ago
Construction of realistic gate sizing benchmarks with known optimal solutions
Gate sizing in VLSI design is a widely-used method for power or area recovery subject to timing constraints. Several previous works have proposed gate sizing heuristics for power ...
Andrew B. Kahng, Seokhyeong Kang
CG
2006
Springer
14 years 1 months ago
Computing Proper Equilibria of Zero-Sum Games
We show that a proper equilibrium of a matrix game can be found in polynomial time by solving a linear (in the number of pure strategies of the two players) number of linear progra...
Peter Bro Miltersen, Troels Bjerre Sørensen
JUCS
2006
91views more  JUCS 2006»
13 years 10 months ago
Creation and Evaluation of Fuzzy Knowledge-base
: In this paper we give a possible model for handling uncertain information. The concept of fuzzy knowledge-base will be defined as a quadruple of any background knowledge, defined...
Ágnes Achs