3229 search results - page 587 / 646 » The Theory of Timed Automata |
CHI
2004
ACM
14 years 10 months ago
2004
ACM
Level of Web experience is often a factor for which researchers attempt to control while conducting experimental studies on Web usability. It is typically measured by some means o...
POPL
2008
ACM
14 years 10 months ago
2008
ACM
When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)disc...
POPL
2006
ACM
14 years 10 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
POPL
2003
ACM
14 years 10 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
STOC
2007
ACM
14 years 10 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...