Sciweavers

3993 search results - page 702 / 799
» Matchmaking for Structured Objects
Sort
View
ICRA
2009
IEEE
126views Robotics» more  ICRA 2009»
15 years 25 days ago
Time-bounded lattice for efficient planning in dynamic environments
For vehicles navigating initially unknown cluttered environments, current state-of-the-art planning algorithms are able to plan and re-plan dynamically-feasible paths efficiently a...
Aleksandr Kushleyev, Maxim Likhachev
ANOR
2010
153views more  ANOR 2010»
15 years 16 days ago
Solving the Rectangular assignment problem and applications
The rectangular assignment problem is a generalization of the linear assignment problem (LAP): one wants to assign a number of persons to a smaller number of jobs, minimizing the ...
J. Bijsterbosch, A. Volgenant
ELECTRONICMARKETS
2010
124views more  ELECTRONICMARKETS 2010»
15 years 14 days ago
The difficulty of studying inter-organisational IS phenomena on large scales: critical reflections on a research journey
We argue that certain theoretical commitments that underpin much existing Interorganisational Information Systems (IOIS) research at small scales become untenable when IOIS are st...
Kai Reimers, Robert B. Johnston, Stefan Klein
INTERACTIONS
2010
92views more  INTERACTIONS 2010»
15 years 11 days ago
PUX: patterns of user experience
s from a concrete to a new abstract level of description [1]. Rises in abstraction level happen regularly in all fields, but the key difference in Alexander's work was that ra...
Alan F. Blackwell, Sally Fincher
AAAI
2010
14 years 12 months ago
Multilinear Maximum Distance Embedding Via L1-Norm Optimization
Dimensionality reduction plays an important role in many machine learning and pattern recognition tasks. In this paper, we present a novel dimensionality reduction algorithm calle...
Yang Liu, Yan Liu, Keith C. C. Chan