2681 search results - page 128 / 537 » Problem F |
98
Voted
SIGCSE
2006
ACM
15 years 6 months ago
2006
ACM
We present a hands-on approach to problem solving in the formal languages and automata theory course. Using the tool JFLAP, students can solve a wide range of problems that are te...
171
Voted
ICSC
1999
Springer
15 years 5 months ago
1999
Springer
The Internet has evolved from an information space to a market space with thousands of electronic storefronts, auctions and other commercial services. This market space is not with...
108
Voted
SWAT
1994
Springer
15 years 4 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
125
click to vote
ATAL
2006
Springer
15 years 4 months ago
2006
Springer
In this paper we propose a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is ext...
132
Voted
GEM
2007
15 years 2 months ago
2007
- Besides the difficulty of the application problem to be solved with Genetic Algorithms (GAs), an additional difficulty arises because the quality of the solution found, or the ...