Sciweavers

272 search results - page 52 / 55
» A Game-Theoretic Approach to Constraint Satisfaction
Sort
View
JAIR
2007
159views more  JAIR 2007»
13 years 8 months ago
Combination Strategies for Semantic Role Labeling
This paper introduces and analyzes a battery of inference models for the problem of semantic role labeling: one based on constraint satisfaction, and several strategies that model...
Mihai Surdeanu, Lluís Màrquez, Xavie...
VLDB
2002
ACM
151views Database» more  VLDB 2002»
13 years 8 months ago
Preference SQL - Design, Implementation, Experiences
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...
Werner Kießling, Gerhard Köstler
IFIP12
2009
13 years 6 months ago
Defining a Task's Temporal Domain for Intelligent Calendar Applications
Abstract Intelligent calendar assistants have many years ago attracted researchers from the areas of scheduling, machine learning and human computer interaction. However, all effor...
Anastasios Alexiadis, Ioannis Refanidis
PRICAI
2004
Springer
14 years 1 months ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...
ISDA
2010
IEEE
13 years 6 months ago
Avoiding simplification strategies by introducing multi-objectiveness in real world problems
Abstract--In business analysis, models are sometimes oversimplified. We pragmatically approach many problems with a single financial objective and include monetary values for non-m...
Charlotte J. C. Rietveld, Gijs P. Hendrix, Frank T...