Sciweavers

1197 search results - page 135 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
JSAC
2008
202views more  JSAC 2008»
13 years 8 months ago
Cognitive Wireless Mesh Networks with Dynamic Spectrum Access
Wireless Mesh Networks (WMNs) are envisaged to extend Internet access and other networking services in personal, local, campus, and metropolitan areas. Mesh routers (MR) form the c...
Kaushik R. Chowdhury, Ian F. Akyildiz
GIS
2011
ACM
12 years 11 months ago
Embedding rivers in triangulated irregular networks with linear programming
Data conflation is a major issue in GIS: different geospatial data sets covering overlapping regions, possibly obtained from different sources and using different acquisition ...
Marc J. van Kreveld, Rodrigo I. Silveira
ICRA
2009
IEEE
98views Robotics» more  ICRA 2009»
14 years 2 months ago
Path following for an omnidirectional mobile robot based on model predictive control
— In this paper, the path following problem of an omnidirectional mobile robot has been studied. Given the error dynamic model derived from the robot state vector and the path st...
Kiattisin Kanjanawanishkul, Andreas Zell
DKE
2002
107views more  DKE 2002»
13 years 8 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias
CP
2006
Springer
13 years 12 months ago
Dynamic Symmetry Breaking Restarted
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
Daniel S. Heller, Meinolf Sellmann