Sciweavers

2681 search results - page 11 / 537
» Problem F
Sort
View
47
Voted
SIGMOBILE
2002
48views more  SIGMOBILE 2002»
15 years 11 days ago
The gray zone problem in IEEE 802.11b based ad hoc networks
Henrik Lundgren, Erik Nordström, Christian F....
77
Voted
TRANSCI
2002
57views more  TRANSCI 2002»
15 years 10 days ago
A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
Jonathan F. Bard, George Kontoravdis, Gang Yu
100
Voted
CCCG
2007
15 years 2 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
72
Voted
ICEIS
2009
IEEE
15 years 7 months ago
Integrating VR in an Engineering Collaborative Problem Solving Environment
Ismael H. F. dos Santos, Alberto Raposo, Marcelo G...