Sciweavers

6455 search results - page 103 / 1291
» Research problems
Sort
View
140
Voted
EAAI
2007
154views more  EAAI 2007»
15 years 3 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
Ahlem Ben Hassine, Tu Bao Ho
PODS
2010
ACM
215views Database» more  PODS 2010»
15 years 8 months ago
An optimal algorithm for the distinct elements problem
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
148
Voted
CEC
2009
IEEE
15 years 8 months ago
Memetic algorithm with Local search chaining for large scale continuous optimization problems
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...
Daniel Molina, Manuel Lozano, Francisco Herrera
146
Voted
CCGRID
2006
IEEE
15 years 5 months ago
Biodiversity World: A Problem-Solving Environment for Analysing Biodiversity Patterns
In the Biodiversity World (BDW) project we have created a flexible and extensible Web Services-based Grid environment for biodiversity researchers to solve problems in biodiversity...
Jaspreet Singh Pahwa, Peter Brewer, Tim Sutton, Ch...
146
Voted
PRICAI
2004
Springer
15 years 9 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...