2107 search results - page 129 / 422 » Computing Small Search Numbers in Linear Time |
144
Voted
COLOGNETWENTE
2009
15 years 4 months ago
2009
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...
106
Voted
CGO
2004
IEEE
15 years 7 months ago
2004
IEEE
Recent research has shown that programs often exhibit value locality. Such locality occurs when a code segment, although executed repeatedly in the program, takes only a small num...
135
Voted
WWW
2005
ACM
16 years 4 months ago
2005
ACM
Link Analysis has been a popular and widely used Web mining technique, especially in the area of Web search. Various ranking schemes based on link analysis have been proposed, of ...
110
click to vote
EOR
2007
15 years 3 months ago
2007
In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NPhard problem has a significant number of practical applications such as environm...
170
click to vote
CAPTECH
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. This paper presents a new technique for computing collisionfree navigation motions from task-level commands for animated human characters in interactive virtual environme...