Sciweavers

5214 search results - page 899 / 1043
» The Online Specialization Problem
Sort
View
STOC
2003
ACM
114views Algorithms» more  STOC 2003»
14 years 10 months ago
Testing subgraphs in directed graphs
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
Noga Alon, Asaf Shapira
AGENTS
1997
Springer
14 years 2 months ago
RoboCup: The Robot World Cup Initiative
The Robot World Cup Initiative (RoboCup) is an attempt to foster AI and intelligent robotics research by providing a standard problem where wide range of technologies can be integ...
Hiroaki Kitano, Minoru Asada, Yasuo Kuniyoshi, Its...
WWW
2009
ACM
14 years 10 months ago
Combining global optimization with local selection for efficient QoS-aware service composition
The run-time binding of web services has been recently put forward in order to support rapid and dynamic web service compositions. With the growing number of alternative web servi...
Mohammad Alrifai, Thomas Risse
WWW
2008
ACM
14 years 10 months ago
Matching independent global constraints for composite web services
Service discovery employs matching techniques to select services by comparing their descriptions against user constraints. Semantic-based matching approaches achieve higher recall...
Nalaka Gooneratne, Zahir Tari
WWW
2005
ACM
14 years 10 months ago
Information search and re-access strategies of experienced web users
Experienced web users have strategies for information search and re-access that are not directly supported by web browsers or search engines. We studied how prevalent these strate...
Anne Aula, Mika Käki, Natalie Jhaveri