11484 search results - page 222 / 2297 » Modeling in the Large and Modeling in the Small |
142
click to vote
RTSS
2002
IEEE
15 years 11 months ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
175
click to vote
ICNP
1999
IEEE
15 years 10 months ago
1999
IEEE
As the most widely used reliable transport in today's Internet, TCP has been extensively studied in the past. However, previous research usually only considers a small or med...
150
click to vote
DEXA
1998
Springer
15 years 10 months ago
1998
Springer
The object identifier index of an object-oriented database system is typically 20% of the size of the database itself, and for large databases, only a small part of the index fits...
160
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
171
click to vote
ISPEC
2010
Springer
15 years 8 months ago
2010
Springer
Often authentication and confidentiality are required as simultaneous key requirements in many cryptographic applications. The cryptographic primitive called signcryption effective...