4480 search results - page 602 / 896 » Prototyping Completion with Constraints Using Computational ... |
172
click to vote
IMSCCS
2006
IEEE
16 years 19 days ago
2006
IEEE
Slowdown is used to measure the fairness degree of a scheduling algorithm in existing work. However, the fairness degree should be considered within a scheduling algorithm; rather...
163
click to vote
IPTPS
2005
Springer
16 years 3 days ago
2005
Springer
In this paper, we present Chainsaw, a p2p overlay multicast system that completely eliminates trees. Peers are notified of new packets by their neighbors and must explicitly requ...
163
click to vote
STACS
2001
Springer
15 years 11 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
155
click to vote
HPCA
1997
IEEE
15 years 10 months ago
1997
IEEE
In this paper we explore software-managed address translation. The purpose of the study is to specify the memory management design for a high clock-rate PowerPC implementation in ...
179
Voted
ACSC
2000
IEEE
15 years 10 months ago
2000
IEEE
A methodology is proposed for the formal development of software systems from a user's requirements specification in natural language into a complete implementation, proceedi...