Sciweavers

5981 search results - page 81 / 1197
» time 2006
Sort
View
98
Voted
IJCSA
2006
75views more  IJCSA 2006»
15 years 1 months ago
The Recommendation Mechanism in an Internet Information System with Time Impact Coefficient
: In this paper we propose two generic mechanisms implemented in a cadastre internet information system. The first one is the list of last queries submitted by a given user and the...
Dariusz Król, Michal Szymanski, Bogdan Traw...
79
Voted
JALC
2006
61views more  JALC 2006»
15 years 1 months ago
Random Polynomial-Time Attacks and Dolev-Yao Models
In this paper we present an extension of Dolev-Yao models for security protocols with a notion of random polynomial-time (Las Vegas) computability. First we notice that Dolev-Yao ...
Mathieu Baudet
94
Voted
JOT
2006
109views more  JOT 2006»
15 years 1 months ago
UML 2.0 Notation for Modeling Real Time Task Scheduling
UML is the standard visual object modeling language which may be very useful as a system design communication language. However, UML as a real-time modeling language has limitatio...
María Cruz Valiente, Gonzalo Génova,...
116
Voted
JPDC
2006
92views more  JPDC 2006»
15 years 1 months ago
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
In distributed shared memory multiprocessors, remote memory references generate processor-to-memory traffic, which may result in a bottleneck. It is therefore important to design ...
Sheng-Hsiung Chen, Ting-Lu Huang
99
Voted
IJAC
2007
59views more  IJAC 2007»
15 years 1 months ago
Polynomial-Time Complexity for Instances of the Endomorphism Problem in Free Groups
Abstract. We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F , there is an endomorphism φ of F ...
Laura Ciobanu