Sciweavers

4524 search results - page 109 / 905
» The Complexity of Global Constraints
Sort
View
92
Voted
ESAW
2006
Springer
15 years 4 months ago
Competence Checking for the Global E-Service Society Using Games
Abstract. We study the problem of checking the competence of communicative agents operating in a global society in order to receive and offer electronic services. Such a society wi...
Kostas Stathis, George Lekeas, Christos Kloukinas
106
Voted
CADE
2010
Springer
15 years 1 months ago
Global Caching for Coalgebraic Description Logics
Coalgebraic description logics offer a common semantic umbrella for extensions of description logics with reasoning principles outside relational semantics, e.g. quantitative uncer...
Rajeev Goré, Clemens Kupke, Dirk Pattinson,...
75
Voted
TCAD
2008
65views more  TCAD 2008»
15 years 17 days ago
Fashion: A Fast and Accurate Solution to Global Routing Problem
This paper presents a fast and accurate solution, namely Fashion, to routability-driven global routing problem. Fashion is based on two efficient yet effective techniques: 1) dynam...
Zhen Cao, Tong Jing, Jinjun Xiong, Yu Hu, Zhe Feng...
AROBOTS
2002
91views more  AROBOTS 2002»
15 years 16 days ago
Fast, On-Line Learning of Globally Consistent Maps
To navigate in unknown environments, mobile robots require the ability to build their own maps. A major problem for robot map building is that odometry-based dead reckoning cannot ...
Tom Duckett, Stephen Marsland, Jonathan Shapiro
128
Voted
ICASSP
2011
IEEE
14 years 4 months ago
Global convergence of independent component analysis based on semidefinite programming relaxation
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
Shotaro Akaho, Jun Fujiki