21324 search results - page 455 / 4265 » Making the case for computing |
199
click to vote
TACAS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
165
click to vote
ISSS
1996
IEEE
15 years 11 months ago
1996
IEEE
In this paper we investigate the problem of code generation for address computation for DSP processors. This work is divided into four parts. First, we propose a branch instructio...
183
click to vote
WSC
2008
15 years 9 months ago
2008
Tunnel construction are essentially infrastructure projects that includes many interfered and sophisticated tasks. This paper presents a decision support tool, Tunnel_Sim, for pla...
167
click to vote
IJCAI
2001
15 years 8 months ago
2001
In the last decade, there has been several studies on the computational complexity of planning. These studies normally assume that the goal of planning is to make a certain fluent...
160
click to vote
FLAIRS
2003
15 years 8 months ago
2003
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...