5981 search results - page 239 / 1197 » time 2006 |
176
click to vote
IIE
2006
15 years 6 months ago
2006
The paper describes some possible ways how to improve Olympiads in Informatics. Tasks in Olympiads are small models of programming tasks in software industry and in the limited amo...
150
click to vote
COMBINATORICS
1998
15 years 6 months ago
1998
Based on a recent improvement of the inclusion-exclusion principle, we present a new approach to network reliability problems. In particular, we give a new proof of a result of Sh...
158
click to vote
ORL
1998
15 years 6 months ago
1998
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...
141
click to vote
ETS
2006
IEEE
16 years 17 days ago
2006
IEEE
This paper proposes a wrapper design for interconnects with guaranteed bandwidth and latency services and on-chip protocol. strate that these interconnects abstract the interconne...
118
click to vote
CG
2006
Springer
15 years 6 months ago
2006
Springer
In this paper, we introduce a new approach to line drawing that attempts to maintain a uniform packing density of horizontal segments to diagonal segments throughout the line. Whi...