Sciweavers

2681 search results - page 11 / 537
» Problem F
Sort
View
SIGMOBILE
2002
48views more  SIGMOBILE 2002»
13 years 8 months ago
The gray zone problem in IEEE 802.11b based ad hoc networks
Henrik Lundgren, Erik Nordström, Christian F....
TRANSCI
2002
57views more  TRANSCI 2002»
13 years 8 months ago
A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
Jonathan F. Bard, George Kontoravdis, Gang Yu
CCCG
2007
13 years 10 months ago
On the Fewest Nets Problem for Convex Polyhedra
Given a convex polyhedron with n vertices and F faces, what is the fewest number of pieces, each of which unfolds to a simple polygon, into which it may be cut by slices along edg...
Val Pinciu
ICEIS
2009
IEEE
14 years 3 months ago
Integrating VR in an Engineering Collaborative Problem Solving Environment
Ismael H. F. dos Santos, Alberto Raposo, Marcelo G...