Sciweavers

4865 search results - page 797 / 973
» The Complexity of Graph Connectivity
Sort
View
WADS
2007
Springer
68views Algorithms» more  WADS 2007»
15 years 10 months ago
On Euclidean Vehicle Routing with Allocation
The (Euclidean) Vehicle Routing Allocation Problem (VRAP) is a generalization of Euclidean TSP. We do not require that all points lie on the salesman tour. However, points that do ...
Jan Remy, Reto Spöhel, Andreas Weißl
101
Voted
ACSC
2006
IEEE
15 years 10 months ago
Rendering multi-perspective images with trilinear projection
Non-linear projections of 3D graphical scenes can be used to compute reflections and refractions in curved surfaces, draw artistic images in the style of Escher or Picasso, and p...
Scott Vallance, Paul R. Calder
ICPADS
2006
IEEE
15 years 10 months ago
Experiences with Simulations - A Light and Fast Model for Secure Web Applications
Using simulations of a complex system such as a Web Application Server provides us with a tool that allows the running of tests without using the resources needed in a real system...
Ramon Nou, Jordi Guitart, David Carrera, Jordi Tor...
ICSEA
2006
IEEE
15 years 10 months ago
Application Driven Software Development
ey operate with computer abstractions not with AD ions they cannot fully bridge the semantic gap between IT and AD. Therefore, we can safely conclude that the research on computer ...
Teodor Rus, Donald Ephraim Curtis
IEEEARES
2006
IEEE
15 years 10 months ago
Application of the Digraph Method in System Fault Diagnostics
There is an increasing demand for highly reliable systems in the safety conscious climate of today’s world. When a fault does occur there are two desirable outcomes. Firstly, de...
E. M. Kelly, L. M. Bartlett