Sciweavers

12459 search results - page 85 / 2492
» cans 2006
Sort
View
IPL
2006
69views more  IPL 2006»
13 years 9 months ago
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
André Große, Jörg Rothe, Gerd We...
ORL
2007
66views more  ORL 2007»
13 years 8 months ago
On polling systems with large setups
Polling systems with large deterministic setup times find many applications in production environments. The present note studies the delay distribution in exhaustive polling syst...
Erik M. M. Winands
INFSOF
2006
159views more  INFSOF 2006»
13 years 9 months ago
Essential communication practices for Extreme Programming in a global software development team
We conducted an industrial case study of a distributed team in the USA and the Czech Republic that used Extreme Programming. Our goal was to understand how this globally-distribut...
Lucas Layman, Laurie Williams, Daniela Damian, Hyn...
TARK
2007
Springer
14 years 3 months ago
Theorems and unawareness
This paper provides a set-theoretic model of knowledge and unawareness, in which reasoning through theorems is employed. A new property called Awareness Leads to Knowledge shows t...
Spyros Galanis
IJNSEC
2006
89views more  IJNSEC 2006»
13 years 9 months ago
Expansion of Sliding Window Method for Finding Shorter Addition/Subtraction-Chains
Finding a shorter addition/subtraction-chain for an integer is an important problem for many cryptographic systems based on number theory. Especially, execution time of multiplica...
Younho Lee, Heeyoul Kim, Seong-Min Hong, Hyunsoo Y...