365 search results - page 4 / 73 » Solving the Multiplication Constraint in Several Approximati... |
TASE
2010
IEEE
13 years 2 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
IAT
2005
IEEE
14 years 1 months ago
2005
IEEE
Cooperative negotiation is proved to be an effective paradigm to solve complex dynamic multi-objective problems in which each objective is associated to an agent. When the multi-o...
ICDE
2004
IEEE
14 years 8 months ago
2004
IEEE
Several spatio-temporal applications require the retrieval of summarized information about moving objects that lie in a query region during a query interval (e.g., the number of m...
SARA
2009
Springer
14 years 2 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
HAPTICS
2008
IEEE
13 years 8 months ago
2008
IEEE
The well known property of haptic interaction is the high refresh rate of the haptic loop that is necessary for the stability of the interaction. Therefore, only simple computation...