Sciweavers

672 search results - page 70 / 135
» A General Solution to the Graph History Interaction Problem
Sort
View
ICWS
2009
IEEE
14 years 6 months ago
Enabling Scaleable, Efficient, Non-visual Web Browsing Services
Over the last few decades, the discipline of Web Accessibility has been focused on building more efficient and more effective speech generators for Web Browsers. The visual browse...
Ashish Verma, Tyrone Grandison, Himanshu Chauhan
AMAI
2004
Springer
13 years 8 months ago
Representing von Neumann-Morgenstern Games in the Situation Calculus
Sequential von Neumann-Morgernstern (VM) games are a very general formalism for representing multi-agent interactions and planning problems in a variety of types of environments. ...
Oliver Schulte, James P. Delgrande
DM
1998
68views more  DM 1998»
13 years 8 months ago
Alternating cycles and trails in 2-edge-coloured complete multigraphs
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive edges differ in colour. Let G be a 2-edge-coloured complete graph and let M b...
Jørgen Bang-Jensen, Gregory Gutin
ICTAI
2010
IEEE
13 years 6 months ago
Multicriteria Reasoning Considering Reliability or Availability
Abstract--Reliability and/or availability are increasingly important aspects in the design of systems, especially networks and service offerings. Optimization here is a multi-crite...
Tarik Hadzic, Helmut Simonis
MICCAI
2006
Springer
14 years 9 months ago
An Energy Minimization Approach to the Data Driven Editing of Presegmented Images/Volumes
Fully automatic, completely reliable segmentation in medical images is an unrealistic expectation with today's technology. However, many automatic segmentation algorithms may ...
Leo Grady, Gareth Funka-Lea