Sciweavers

2519 search results - page 335 / 504
» Reasoning with Textual Cases
Sort
View
IPL
2008
89views more  IPL 2008»
15 years 6 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik
DAM
2007
153views more  DAM 2007»
15 years 6 months ago
Computing the minimum number of hybridization events for a consistent evolutionary history
It is now well-documented that the structure of evolutionary relationships between a set of present-day species is not necessarily tree-like. The reason for this is that reticulat...
Magnus Bordewich, Charles Semple
EOR
2007
75views more  EOR 2007»
15 years 6 months ago
Improved modeling and solution methods for the multi-resource routing problem
This paper presents modeling and solution method improvements for the Multi-Resource Routing Problem (MRRP) with flexible tasks. The MRRP with flexible tasks is used to model ro...
Peter Francis, Guangming Zhang, Karen R. Smilowitz
AIR
2002
125views more  AIR 2002»
15 years 6 months ago
Interactive Critiquing for Catalog Navigation in E-Commerce
E-commerce sites can have large, essentially unbounded, catalogs. With large catalogs comes increasing difficulty for buyers in making use of standard search and browsing faciliti...
Robin D. Burke
MFCS
2010
Springer
15 years 5 months ago
Asynchronous Omega-Regular Games with Partial Information
We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a gene...
Bernd Puchala