1843 search results - page 201 / 369 » Securing Class Initialization |
180
click to vote
ICRA
2000
IEEE
15 years 11 months ago
2000
IEEE
Vision feedback control loop techniques are efficient for a great class of applications but they come up against difficulties when the initial and desired positions of the camer...
157
click to vote
CHI
1999
ACM
15 years 10 months ago
1999
ACM
This paper introduces a novel interface for digitallyaugmented cooperative play. We present the concept of the "athletic-tangible interface," a new class of interaction ...
190
click to vote
EPS
1998
Springer
15 years 10 months ago
1998
Springer
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel ...
166
click to vote
PATAT
1997
Springer
15 years 10 months ago
1997
Springer
In this study we have tackled the NP-hard problem of academic class scheduling (or timetabling) at the university level. We have investigated a variety of approaches based on simu...
143
click to vote
STOC
1993
ACM
15 years 10 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...