1027 search results - page 92 / 206 » Opening Up The Enterprise |
131
click to vote
MP
2006
15 years 6 months ago
2006
A method is proposed for finding the global minimum of a multivariate polynomial via sum of squares (SOS) relaxation over its gradient variety. That variety consists of all points ...
129
click to vote
SIAMDM
2008
15 years 6 months ago
2008
From computational geometry comes the notion of a Gabriel graph of a point set in the plane. The Gabriel graph consists of those edges connecting two points of the point set such t...
151
click to vote
JCP
2007
15 years 6 months ago
2007
—Educational technology is seen as key for lifelong learning, but it has yet to live up to expectation. We argue that current learning environments are typically oriented too muc...
171
click to vote
AIR
2004
15 years 6 months ago
2004
The vehicle routing problems with time windows are challenging delivery problems in which instances involving 100 customers or more can be difficult to solve. There were many inter...
150
click to vote
CSUR
2000
15 years 6 months ago
2000
: Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of co...